Computing algebraic numbers of bounded height

DOI10.1090/MCOM/2954MaRDI QIDQ5501149zbMATH OpenOpenAlexFDO

Authors 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)

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

Recommendations

• Computing points of bounded height in projective space over a number field
• Elements with bounded height in number fields
• Counting algebraic numbers with large height II
• Counting algebraic integers of fixed degree and bounded height
• On validated computing in algebraic number fields

Cites work

• scientific article; zbMATH DE number 435565 (Why is no real title available?)
• scientific article; zbMATH DE number 3859248 (Why is no real title available?)
• scientific article; zbMATH DE number 4200333 (Why is no real title available?)
• scientific article; zbMATH DE number 4144078 (Why is no real title available?)
• scientific article; zbMATH DE number 3539473 (Why is no real title available?)
• scientific article; zbMATH DE number 475434 (Why is no real title available?)
• scientific article; zbMATH DE number 194764 (Why is no real title available?)
• scientific article; zbMATH DE number 1405493 (Why is no real title available?)
• Algorithms in Algebraic Number Theory
• Counting integral ideals in a number field
• Effective lattice point counting in rational convex polytopes
• Elements with bounded height in number fields
• Factoring polynomials with rational coefficients
• Heights in number fields
• Number fields unramified away from 2
• Preperiodic points for quadratic polynomials over quadratic fields
• Short proofs using compact representations of algebraic integers
• The arithmetic of dynamical systems
• The classification of rational preperiodic points of quadratic polynomials over \(\mathbb{Q}\): A refined conjecture
• Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding

Cited in

(7)

• Examples of abelian surfaces with everywhere good reduction
• Computing points of bounded height in projective space over a number field
• On the existence of abelian surfaces with everywhere good reduction
• The size of algebraic integers with many real conjugates
• Thue equations and CM-fields
• Elements with bounded height in number fields
• Counting Algebraic Numbers with Large Height I

Describes a project that uses

Uses Software

• LattE
• SageMath

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

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