Algorithms for Galois extensions of global function fields. (Abstract of thesis)

DOI10.1017/S0004972715001793MaRDI QIDQ2814352zbMATH OpenOpenAlexFDO

Authors Nicole Sutherland

Publication date 21 June 2016

Published in Bulletin of the Australian Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s0004972715001793

zbMATH Keywords

cyclic Galois extensionsfunction fieldsGalois groupsintegral closuresmaximal orders

Mathematics Subject Classification ID

Galois theory (11R32) Class field theory (11R37) Arithmetic theory of algebraic function fields (11R58) Number-theoretic algorithms; complexity (11Y16) Algebraic number theory computations (11Y40) Algebraic functions and function fields in algebraic geometry (14H05)

Recommendations

• Computation of maximal orders of cyclic extensions of function fields
• On the Computation of Integral Closures of Cyclic Extensions of Function Fields
• Computing Galois groups of polynomials (especially over function fields of prime characteristic)
• An efficient algorithm for the computation of Galois automorphisms
• Computation of Galois groups over function fields

Cites work

• Advanced Topics in Computional Number Theory
• Computing Galois groups of polynomials (especially over function fields of prime characteristic)
• Efficient computation of maximal orders in Artin-Schreier extensions
• Efficient computation of maximal orders in radical (including Kummer) extensions
• In memoriam: Hans Zassenhaus (1912-1991)

Cited in

(3)

• Computation of maximal orders of cyclic extensions of function fields
• On the Computation of Integral Closures of Cyclic Extensions of Function Fields
• Computations in Galois cohomology

This page was built for publication: Algorithms for Galois extensions of global function fields. (Abstract of thesis)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2814352)