Abstract
We present algorithms for constructing and tabulating degree-‘ dihedral extensions of Fq.x/, where q 1 mod 2‘. We begin with a Kummer-theoretic algorithm for constructing these function fields with prescribed ramification and fixed quadratic resolvent field. This algorithm is based on the proof of our main theorem, which gives an exact count for such fields. We then use this construction method in a tabulation algorithm to construct all degree-‘ dihedral extensions of Fq.x/ up to a given discriminant bound, and we present tabulation data. We also give a formula for the number of degree-‘ dihedral extensions of Fq.x/ with discriminant divisor of degree 2.‘ 1/, the minimum possible.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
