Computing points of bounded height in projective space over a number field
From MaRDI portal
Publication:3450044
DOI10.1090/mcom/2984zbMath1400.11165arXiv1403.6501OpenAlexW2121954221MaRDI QIDQ3450044
Publication date: 2 November 2015
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1403.6501
Rational points (14G05) Algebraic number theory computations (11Y40) Lattice points in specified regions (11P21) Software, source code, etc. for problems pertaining to number theory (11-04)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Examples of abelian surfaces with everywhere good reduction
- Improvements in the computation of ideal class groups of imaginary quadratic number fields
- Factoring polynomials with rational coefficients
- Preperiodic points for quadratic polynomials over quadratic fields
- Effective lattice point counting in rational convex polytopes
- Lipschitz class, narrow class, and counting lattice points
- Improved Methods for Calculating Vectors of Short Length in a Lattice, Including a Complexity Analysis
- A Rigorous Subexponential Algorithm For Computation of Class Groups
- An LLL Algorithm with Quadratic Complexity
- Heights in number fields
- Algorithms in Algebraic Number Theory
- Applying sieving to the computation of quadratic class groups
- On the height constant for curves of genus two, II
- An Explicit Theory of Heights for Hyperelliptic Jacobians of Genus Three
- A Polynomial Time Algorithm for Counting Integral Points in Polyhedra When the Dimension is Fixed
- On the height constant for curves of genus two
- Counting primitive points of bounded height
- Computing algebraic numbers of bounded height
- Elements with bounded height in number fields
This page was built for publication: Computing points of bounded height in projective space over a number field
