ALGORITHMS FOR GALOIS EXTENSIONS OF GLOBAL FUNCTION FIELDS

DOI10.1017/S0004972715001793zbMath1410.11137OpenAlexW902845344MaRDI QIDQ2814352

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

function fieldsGalois groupsmaximal ordersintegral closurescyclic Galois extensions

Mathematics Subject Classification ID

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

Cites Work

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

This page was built for publication: ALGORITHMS FOR GALOIS EXTENSIONS OF GLOBAL FUNCTION FIELDS