Efficient computation of maximal orders in Artin-Schreier extensions

DOI10.1016/J.JSC.2012.11.001MaRDI QIDQ1946963zbMATH OpenOpenAlexFDO

Authors Nicole Sutherland

Publication date 10 April 2013

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

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

zbMATH Keywords

Artin-Schreier extensionsmaximal orders

Mathematics Subject Classification ID

Arithmetic theory of algebraic function fields (11R58) Algebraic number theory computations (11Y40) Symbolic computation and algebraic computation (68W30)

Recommendations

• Efficient computation of maximal orders in Artin-Schreier-Witt extensions
• Efficient computation of maximal orders in radical (including Kummer) extensions
• Computation of maximal orders of cyclic extensions of function fields
• scientific article; zbMATH DE number 2186836
• Elements of high order in Artin-Schreier extensions of finite fields
• Maximal orders in Artinian rings
• Fast arithmetics in Artin-Schreier towers over finite fields
• Fast arithmetics in Artin-Schreier towers over finite fields
• Algorithmic properties of maximal orders in simple algebras over \(\mathbb{Q}\)
• Artin-Schreier extensions and generalized associated orders

Cited in

(5)

• Efficient computation of maximal orders in Artin-Schreier-Witt extensions
• Algorithms for Galois extensions of global function fields. (Abstract of thesis)
• Computation of maximal orders of cyclic extensions of function fields
• On the Computation of Integral Closures of Cyclic Extensions of Function Fields
• Efficient computation of maximal orders in radical (including Kummer) extensions

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

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