Computing algebraic numbers of bounded height

DOI10.1090/mcom/2954zbMath1330.11081arXiv1111.4963OpenAlexW2132568670MaRDI QIDQ5501149

John R. Doyle, David Krumm

Publication date: 13 August 2015

Published in: Mathematics of Computation (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Algebraic number theory computations (11Y40)

Related Items (5)

Computing points of bounded height in projective space over a number field ⋮ The size of algebraic integers with many real conjugates ⋮ On the existence of abelian surfaces with everywhere good reduction ⋮ Thue equations and CM-fields ⋮ Examples of abelian surfaces with everywhere good reduction

Uses Software

• SageMath
• LattE

Cites Work

• Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding
• Number fields unramified away from 2
• The classification of rational preperiodic points of quadratic polynomials over \(\mathbb{Q}\): A refined conjecture
• Factoring polynomials with rational coefficients
• Short proofs using compact representations of algebraic integers
• Counting integral ideals in a number field
• Preperiodic points for quadratic polynomials over quadratic fields
• Effective lattice point counting in rational convex polytopes
• Heights in number fields
• Algorithms in Algebraic Number Theory
• Elements with bounded height in number fields
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Computing algebraic numbers of bounded height