Computing algebraic numbers of bounded height

We describe an algorithm for listing all elements of bounded height in a given number field.

[1]  John R. Doyle,et al.  Preperiodic points for quadratic polynomials over quadratic fields , 2013, 1309.6401.

[2]  A. Barvinok,et al.  An Algorithmic Theory of Lattice Points in Polyhedra , 1999 .

[3]  M. Murty,et al.  Counting integral ideals in a number field , 2007 .

[4]  J. Silverman.  The Arithmetic of Dynamical Systems , 2007 .

[5]  Alexander I. Barvinok,et al.  A Polynomial Time Algorithm for Counting Integral Points in Polyhedra when the Dimension Is Fixed , 1993, FOCS.

[6]  S. Schanuel,et al.  On heights in number fields , 1964 .

[7]  Michael E. Pohst,et al.  A procedure for determining algebraic integers of given norm , 1983, EUROCAL.

[8]  Christoph Thiel,et al.  Short Proofs Using Compact Representations of Algebraic Integers , 1995, J. Complex..

[9]  H. Lenstra,et al.  Algorithms in algebraic number theory , 1992, math/9204234.

[10]  A. Barvinok.  A polynomial time algorithm for counting integral points in polyhedra when the dimension is fixed , 1994 .

[11]  S. Lang.  Algebraic Number Theory , 1971 .

[12]  Helmut Hasse,et al.  Number Theory , 2020, An Introduction to Probabilistic Number Theory.

[13]  J. Buchmann.  A subexponential algorithm for the determination of class groups and regulators of algebraic number fields , 1990 .

[14]  Bjorn Poonen,et al.  The classification of rational preperiodic points of quadratic polynomials over ${\Bbb Q}$: a refined conjecture , 1998 .

[15]  Stephen Hoel Schanuel.  Heights in number fields , 1979 .

[16]  H. Lenstra,et al.  Factoring integers with the number field sieve , 1993 .

[17]  Michael Pohst,et al.  Algorithmic algebraic number theory , 1989, Encyclopedia of mathematics and its applications.

[18]  Jesús A. De Loera,et al.  Effective lattice point counting in rational convex polytopes , 2004, J. Symb. Comput..

[19]  Victor Y. Pan,et al.  Univariate Polynomials: Nearly Optimal Algorithms for Numerical Factorization and Root-finding , 2002, J. Symb. Comput..

[20]  Henri Cohen,et al.  A course in computational algebraic number theory , 1993, Graduate texts in mathematics.

[21]  Christoph Thiel,et al.  Under the assumption of the generalized Riemann Hyothesis verifying the class number belongs to NPcapCo-NP , 1994, ANTS.

[22]  W. Rudin.  Principles of mathematical analysis , 1964 .

[23]  Susanne Schmitt,et al.  Elements with bounded height in number fields , 2002, Period. Math. Hung..

[24]  László Lovász,et al.  Factoring polynomials with rational coefficients , 1982 .