Constructing and Tabulating Dihedral Function Fields

atmire.migration.oldid1307
dc.contributor.advisorScheidler, Renate
dc.contributor.authorWeir, Colin
dc.date.accessioned2013-09-09T21:29:11Z
dc.date.available2013-11-12T08:00:11Z
dc.date.issued2013-09-09
dc.date.submitted2013en
dc.description.abstractWe present and implement algorithms for constructing and tabulating odd prime degree l dihedral extensions of a rational function field k_0(x), where k_0 is a perfect field with characteristic not dividing 2l. We begin with a class field theoretic construction algorithm when k0 is a finite field. We also describe modifications to this algorithm to improve the run time of its implementation. Subsequently, we introduce a Kummer theoretic algorithm for constructing dihedral function fields with prescribed ramification and fixed quadratic resolvent field, when k0 is a perfect field and not necessarily finite. We give a detailed description of this Kummer theoretic approach when k0, or a quadratic extension thereof, contains the l-th roots of unity. Avoiding the case when k0 is infinite and the quadratic resolvent field is a constant field extension of k0(x), we show that our Kummer theoretic algorithm constructs all degree l dihedral extensions of k0(x) with prescribed ramification. This algorithm is based on the proof of our main theorem, which gives an exact count of such fields. When k0 is a finite field, we implement and experimentally compare the run times of the class field theoretic and Kummer theoretic construction algorithms. We find that the Kummer theoretic approach performs better in all cases, and hence we use it later in our tabulation method. Lastly, utilizing the automorphism group of Fq(x), we present a tabulation algorithm to construct all degree l dihedral extensions of Fq(x) up to a given discriminant bound, and we present tabulation data. This data is then compared to known asymptotic predictions, and we find that these estimates over-count the number of such fields. We also give a formula for the number of degree l dihedral extensions of Fq(x) when q is plus or minus 1 mod 2l, with discriminant divisors of minimum possible degree.en_US
dc.identifier.citationWeir, C. (2013). Constructing and Tabulating Dihedral Function Fields (Doctoral thesis, University of Calgary, Calgary, Canada). Retrieved from https://prism.ucalgary.ca. doi:10.11575/PRISM/25427en_US
dc.identifier.doihttp://dx.doi.org/10.11575/PRISM/25427
dc.identifier.urihttp://hdl.handle.net/11023/936
dc.language.isoeng
dc.publisher.facultyGraduate Studies
dc.publisher.institutionUniversity of Calgaryen
dc.publisher.placeCalgaryen
dc.rightsUniversity of Calgary graduate students retain copyright ownership and moral rights for their thesis. You may use this material in any way that is permitted by the Copyright Act or through licensing that has been assigned to the document. For uses that are not allowable under copyright legislation or licensing, you are required to seek permission.
dc.subjectMathematics
dc.subjectMathematics
dc.subject.classificationnumber theoryen_US
dc.subject.classificationfunction fieldsen_US
dc.subject.classificationGalois theoryen_US
dc.subject.classificationtabulationen_US
dc.subject.classificationdihedralen_US
dc.subject.classificationKummer theoryen_US
dc.subject.classificationClass field theoryen_US
dc.titleConstructing and Tabulating Dihedral Function Fields
dc.typedoctoral thesis
thesis.degree.disciplineMathematics and Statistics
thesis.degree.grantorUniversity of Calgary
thesis.degree.nameDoctor of Philosophy (PhD)
ucalgary.item.requestcopytrue
Files
Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
ucalgary_2013_weir_colin.pdf
Size:
808.38 KB
Format:
Adobe Portable Document Format
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
2.65 KB
Format:
Item-specific license agreed upon to submission
Description: