On the computation of overorders

DOI10.1142/S179304212050044XzbMATH Open1453.11169arXiv1909.10860OpenAlexW2981825640WikidataQ126984428 ScholiaQ126984428MaRDI QIDQ5111943FDOQ5111943

Authors: Tommy Hofmann, Carlo Sircana 

Publication date: 27 May 2020

Published in: International Journal of Number Theory (Search for Journal in Brave)

Abstract: The computation of a maximal order of an order in a semisimple algebra over a global field is a classical well-studied problem in algorithmic number theory. In this paper we consider the related problems of computing all minimal overorders as well as all overorders of a given order. We use techniques from algorithmic representation theory and the theory of minimal integral ring extensions to obtain efficient and practical algorithms, whose implementation is publicly available.

Full work available at URL: https://arxiv.org/abs/1909.10860

Recommendations

• Finding maximal orders in semisimple algebras over \(\mathbb{Q}\)
• Algorithmic Number Theory
• Efficient computation of maximal orders in radical (including Kummer) extensions
• Computing the ideal class monoid of an order
• scientific article; zbMATH DE number 2186836

zbMATH Keywords

algorithmsconductorordersnumber fieldssemisimple algebrassemisimple algebraBass orderGorenstein orderindex ideal

Mathematics Subject Classification ID

Algebraic numbers; rings of algebraic integers (11R04) Algebraic number theory computations (11Y40) Other algebras and orders, and their zeta and (L)-functions (11R54)

Cites Work

• Title not available (Why is that?)
• On the ubiquity of Gorenstein rings
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Orders in cubic number fields
• A note on conductor ideals
• Conductor ideals of orders in algebraic number fields
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the two generator problem for the ideals of a one-dimensional ring
• Computing endomorphism rings of abelian varieties of dimension two
• Homomorphismes minimaux d'anneaux
• Title not available (Why is that?)
• Subgroup lattices and symmetric functions
• Algorithms in Algebraic Number Theory
• Title not available (Why is that?)
• Title not available (Why is that?)
• Finding maximal orders in semisimple algebras over \(\mathbb{Q}\)
• On orders in quaternion algebras
• Computing endomorphism rings of elliptic curves under the GRH
• Title not available (Why is that?)
• Nemo/Hecke. Computer algebra and number theory packages for the Julia programming language
• Computing the ideal class monoid of an order
• Computing square-free polarized abelian varieties over finite fields
• On the construction of class fields
• Title not available (Why is that?)

Cited In (8)

• Computing the ideal class monoid of an order
• Title not available (Why is that?)
• Cohen-Macaulay type of orders, generators and ideal classes
• Ideal classes of orders in quaternion algebras
• Finding maximal orders in semisimple algebras over \(\mathbb{Q}\)
• Algorithmic Number Theory
• Computing generators of free modules over orders in group algebras. II.
• On the computation of the endomorphism rings of abelian surfaces

Uses Software

• Hecke
• Nemo

This page was built for publication: On the computation of overorders

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