Approximating rings of integers in number fields

DOI10.5802/jtnb.113zbMath0828.11075OpenAlexW2021409800MaRDI QIDQ1805356

Johannes A. Buchmann, Hendrik W. jun. Lenstra

Publication date: 19 December 1995

Published in: Journal de Théorie des Nombres de Bordeaux (Search for Journal in Brave)

Full work available at URL: http://www.numdam.org/item?id=JTNB_1994__6_2_221_0

zbMATH Keywords

surveypolynomial time algorithmscomputing the maximal order of an algebraic number field

Mathematics Subject Classification ID

Algebraic number theory computations (11Y40) Integral representations related to algebraic numbers; Galois module structure of rings of integers (11R33) Other algebras and orders, and their zeta and (L)-functions (11R54)

Related Items (31)

Computing Fourier Coefficients of Level One Modular Forms ⋮ Algorithmic theory of arithmetic rings, Prüfer rings and Dedekind rings. (Théorie algorithmique des anneaux arithmétiques, des anneaux de Prüfer et des anneaux de Dedekind.) ⋮ Fitting ideals and the Gorenstein property ⋮ A relative van Hoeij algorithm over number fields ⋮ Variations in the distribution of principally polarized abelian varieties among isogeny classes ⋮ Explicit construction of integral bases of radical function fields ⋮ Square-free OM computation of global integral bases ⋮ Efficient computation of maximal orders in radical (including Kummer) extensions ⋮ Computing canonical heights on elliptic curves in quasi-linear time ⋮ Higher Newton polygons in the computation of discriminants and prime ideal decomposition in number fields ⋮ Relations among discriminant, different, and conductor of an order ⋮ Group structures of elementary supersingular abelian varieties over finite fields. ⋮ Identifying the Matrix Ring: Algorithms for Quaternion Algebras and Quadratic Forms ⋮ The Factorization of the Ninth Fermat Number ⋮ Computing the ideal class monoid of an order ⋮ On the complexity of computing the 2-Selmer group of an elliptic curve ⋮ Isogeny graphs of ordinary abelian varieties ⋮ Explicit Galois realization of transitive groups of degree up to 15 ⋮ On the zeta function associated with module classes of a number field ⋮ A natural lattice basis problem with applications ⋮ Recognizing Units in Number Fields ⋮ Topics in computational algebraic number theory ⋮ Dynamical Gröbner bases over Dedekind rings ⋮ Henselian valued fields: a constructive point of view ⋮ A Polynomial with Galois Groups SL₂(F₁₆) ⋮ Isogeny graphs with maximal real multiplication ⋮ Computing abelian varieties over finite fields isogenous to a power ⋮ Dynamical algebraic structures, pointfree topological spaces and Hilbert's program. (Structures algébriques dynamiques, espaces topologiques sans points et programme de Hilbert) ⋮ Computing Igusa class polynomials ⋮ Computing Riemann-Roch spaces in algebraic function fields and related topics. ⋮ Computations of Galois representations associated to modular forms of level one

Cites Work

• Factoring integers with elliptic curves
• Some remarks on computing the square parts of integers
• Factoring polynomials with rational coefficients
• Serre's conjecture
• Miller's primality test
• Computational problems, methods, and results in algebraic number theory
• On the ubiquity of Gorenstein rings
• The Factorization of the Ninth Fermat Number
• Factor Refinement
• The Computational Complexity of the Resolution of Plane Curve Singularities
• Asymptotically Fast Triangularization of Matrices over Rings
• Algorithms in Algebraic Number Theory
• A Rigorous Time Bound for Factoring Integers
• Generalization of a theorem of Siegel
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Approximating rings of integers in number fields