On the computation of overorders

DOI10.1142/S179304212050044XMaRDI QIDQ5111943zbMATHOpenAlexWikidataFDO

Authors Tommy Hofmann, Carlo Sircana

Publication date 27 May 2020

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

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

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)

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.

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

Cites work

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

Cited in

(9)

• Computing normalizers of tiled orders in \(M_n(k)\)
• Computing generators of free modules over orders in group algebras. II.
• Algorithmic Number Theory
• On the computation of the endomorphism rings of abelian surfaces
• Computing the ideal class monoid of an order
• Finding maximal orders in semisimple algebras over \(\mathbb{Q}\)
• Ideal classes of orders in quaternion algebras
• Cohen-Macaulay type of orders, generators and ideal classes
• scientific article; zbMATH DE number 2186836 (Why is no real title available?)

Describes a project that uses

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)