Efficient computation of maximal orders in Artin-Schreier-Witt extensions

DOI10.1016/j.jsc.2016.01.008zbMath1414.11159OpenAlexW3013839258MaRDI QIDQ277232

Nicole Sutherland

Publication date: 4 May 2016

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jsc.2016.01.008

zbMATH Keywords

maximal ordersArtin-Schreier-Witt extensions

Mathematics Subject Classification ID

Arithmetic theory of algebraic function fields (11R58) Number-theoretic algorithms; complexity (11Y16) Class field theory (11R37) Other abelian and metabelian extensions (11R20)

Uses Software

• Magma

Cites Work

• Efficient computation of maximal orders in radical (including Kummer) extensions
• Algebraic function fields and codes
• Implementing the Round Four maximal order algorithm
• Efficient computation of maximal orders in Artin-Schreier extensions
• Applications of the class field theory of global fields
• Advanced Topics in Computional Number Theory
• On computations in Kummer extensions.
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Efficient computation of maximal orders in Artin-Schreier-Witt extensions