Explicit counting of ideals in number fields of arbitrary degree
Pith reviewed 2026-05-10 01:25 UTC · model grok-4.3
The pith
Lattice-theoretic choices of fundamental domains for the unit group cut the degree dependence of error terms when counting ideals in number fields.
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
By replacing the conventional fundamental domain for the action of the infinite-order units on the Minkowski embedding with an alternative domain selected via lattice theory, one obtains an explicit formula for the number of integral ideals whose error term depends on the degree n far more mildly than the n to the n squared growth that appears in prior work; the same construction extends Schmidt's partition trick to this setting.
What carries the argument
Alternative fundamental domains for the infinite-order unit action in Minkowski space, chosen by lattice-theoretic criteria to reduce the measure of the boundary region that contributes to the counting error.
If this is right
- The error term loses all factors of the form n to the n squared and replaces them with milder polynomial or exponential dependence on n.
- The bounds remain informative for number fields whose degree is large enough that earlier formulas give trivial or negative results.
- Schmidt's partition trick applies directly after the domain change, yielding a further refinement without extra degree-dependent overhead.
- The same domain choice produces explicit constants in the asymptotic expansion of the ideal-counting function.
Where Pith is reading between the lines
- The method may also tighten explicit bounds on the residue of the Dedekind zeta function at s=1 or on the class number in high-degree fields.
- Direct numerical comparison on cyclotomic fields of increasing degree would immediately test whether the predicted error reduction appears in practice.
- Similar lattice-domain optimization could be tried on other counting problems that involve units acting on logarithmic embeddings.
Load-bearing premise
That the lattice-theoretic domains produce a net reduction in total error once the volume, boundary, and unit-action contributions are all re-estimated together.
What would settle it
For a concrete number field of degree at least 20 whose ideal-counting function is known exactly or to high precision, compute both the old and new explicit bounds and check whether the new error interval is narrower; if it is not, the claimed improvement does not hold.
read the original abstract
We implement methods from the geometry of numbers to give explicit estimates for the number of integral ideals in a number field. We pay particular attention to minimising the effect of the degree $n$ of the number field on the error term and avoid terms on the order of $n^{n^2}$. We do this by studying fundamental domains for the action of multiplying with units of infinite order in Minkowski space. With some lattice theory we show that one can make different choices for such a fundamental domain, which yield a smaller error, especially when the degree of the field extension is large. We also adapt Schmidt's partition trick to this generalised setting.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The manuscript develops explicit estimates for the number of integral ideals in a number field of degree n using geometry of numbers. It selects alternative fundamental domains for the infinite-order unit group action in Minkowski space via lattice-theoretic methods (such as successive minima) to reduce the n-dependence in the error term and avoid factors of order n^{n^2}, while adapting Schmidt's partition trick to the generalized setting.
Significance. If the estimates hold, the work would improve explicit bounds for ideal counting in high-degree fields, aiding effective results in algebraic number theory and computational applications. Credit is due for the parameter-free re-application of standard lattice facts to the unit lattice and the direct adaptation of Schmidt's trick, which together address the central goal without introducing circularity or hidden axioms.
Simulated Author's Rebuttal
We thank the referee for their positive summary of our work on explicit ideal counting in number fields and for recommending minor revision. The report correctly identifies our use of alternative fundamental domains via lattice methods and the adaptation of Schmidt's partition trick to reduce the n-dependence in error terms. As no specific major comments were provided, we have conducted a careful review of the manuscript for clarity and minor improvements.
Circularity Check
No significant circularity; derivation applies standard external tools
full rationale
The paper derives explicit ideal-counting bounds by applying geometry-of-numbers estimates to the logarithmic embedding, constructing alternative fundamental domains via successive minima and lattice reduction, then adapting Schmidt's partition to the new domains. These steps invoke only classical lattice facts and prior non-self-cited results; no equation equates a fitted or derived quantity to its own input, no load-bearing premise rests on an unverified self-citation, and the error-term improvement is obtained by explicit re-application of parameter-free lattice inequalities rather than by renaming or redefining the target count. The derivation is therefore self-contained against external benchmarks.
Axiom & Free-Parameter Ledger
axioms (1)
- domain assumption Methods from the geometry of numbers apply to counting integral ideals via the Minkowski embedding of the ring of integers.
Reference graph
Works this paper leans on
-
[1]
The. The. 2026 , note =
work page 2026
-
[2]
Lagarias, J. C. and Odlyzko, A. M. , TITLE =. Algebraic number fields:. 1977 , MRCLASS =
work page 1977
-
[3]
Winckler, Bruno , month = nov, year =. Théorème de. doi:10.48550/arXiv.1311.5715 , urldate =
- [4]
-
[5]
Shapiro, Harold N. , title =. Communications on Pure and Applied Mathematics , volume =. doi:https://doi.org/10.1002/cpa.3160020401 , url =. https://onlinelibrary.wiley.com/doi/pdf/10.1002/cpa.3160020401 , year =
-
[6]
Minkowski, Hermann , booktitle =. Geometrie der Zahlen , year =
- [7]
-
[8]
Sunley, Judith E. , TITLE =. Bulletin of the American Mathematical Society , VOLUME =. 1972 , PAGES =. doi:10.1090/S0002-9904-1972-12859-3 , URL =
-
[9]
Journal of Mathematical Analysis and Applications , author =
On the number of integral ideals in a number field , volume =. Journal of Mathematical Analysis and Applications , author =. 2023 , keywords =. doi:10.1016/j.jmaa.2022.126585 , abstract =
-
[10]
Landau, Edmund , address =. Einführung in die Elementare und Analytische Theorie der Algebraischen Zahlen und der Ideale , year =
-
[11]
Cassels, John W. S. , address =. An introduction to the geometry of numbers , year =
-
[12]
International Journal of Number Theory , ISSN =
Debaene, Korneel , Title =. International Journal of Number Theory , ISSN =. 2019 , Language =. doi:10.1142/S1793042119500477 , Keywords =
-
[13]
Transactions of the American Mathematical Society , ISSN =
Widmer, Martin , Title =. Transactions of the American Mathematical Society , ISSN =. 2010 , Language =. doi:10.1090/S0002-9947-10-05173-1 , Keywords =
-
[14]
Northcott's theorem on heights. Acta Arithmetica , author =. 1995 , pages =. doi:10.4064/aa-70-4-343-375 , language =
-
[15]
Canadian Journal of Mathematics , publisher=
Louboutin, Stéphane , year=. Canadian Journal of Mathematics , publisher=. doi:10.4153/CJM-2001-045-5 , number=
-
[16]
Dimitrov, Vesselin , month = dec, year =. A proof of the. doi:10.48550/arXiv.1912.12545 , urldate =
- [17]
-
[18]
Lattices and the Geometry of Numbers , doi =
Ghosh, Sourangshu , year =. Lattices and the Geometry of Numbers , doi =
-
[19]
Factoring polynomials with rational coefficients , volume =. Mathematische Annalen , author =. 1982 , pages =. doi:10.1007/BF01457454 , language =
- [20]
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.