Matching works

4 works

math.NT — Number Theory

Bounds for the smallest limit point of the areal Mahler measure of totally positive algebraic integers

Contributed by Tejasvi Singh Tomar

Pritsker's areal analog ∥P∥0\|P\|_0 of the Mahler measure replaces the integral of log⁡∣P∣\log|P| over the unit circle by its integral over the unit disc with respect to normalized area. For an algebraic number α\alpha of degree nn with minimal polynomial P∈Z[x]P\in\mathbb{Z}[x], taken primitive with positive leading coefficient, let N0(α)=∥P∥01/nN_0(\alpha)=\|P\|_0^{1/n}. Flammang proved that N0(α)≥1.380047N_0(\alpha)\ge1.380047 for every totally positive algebraic integer α\alpha outside an explicit finite set. We prove that the smallest limit point of the values of N0N_0 on totally positive algebraic integers and their essential minimum lie between 1.38301341.3830134 and 1.38395791.3839579. The lower bound improves on Flammang's constant: it holds for all but finitely many totally positive algebraic numbers, not only integers, although the exceptions are not determined. Infinitely many totally positive algebraic integers satisfy N0(α)<1.3839579N_0(\alpha)<1.3839579. The lower bound comes from an auxiliary function with a logarithmic energy term, and the upper bound from an explicit measure that, by a criterion and a theorem of Smith, is a limit of distributions of conjugates of totally positive algebraic integers. The inequalities behind both bounds are verified in ball arithmetic, and both bounds are also proved in Lean, the upper one assuming Smith's theorem.

Author comments: Published on Zenodo: https://doi.org/10.5281/zenodo.23715993

A mix of human-written and AI-generated textHuman understanding: all parts
Nov 15, 202610 pages
PDFView work

math.NT — Number Theory

An upper bound for the smallest limit point of the absolute Mahler measure of totally positive algebraic integers

Contributed by Tejasvi Singh Tomar

Let ℓ+\ell_+ be the smallest limit point of the values of the absolute Mahler measure Ω(α)=M(α)1/deg⁡α\Omega(\alpha)=M(\alpha)^{1/\deg\alpha} on totally positive algebraic integers α\alpha. Smyth's work gives ℓ+≤ℓ2=1.72731…\ell_+\le\ell^2=1.72731\ldots, where ℓ=1.31427…\ell=1.31427\ldots is the limit point that he found for totally real algebraic integers. We prove ℓ+≤1.7239501\ell_+\le1.7239501, and that infinitely many totally positive algebraic integers satisfy Ω(α)<1.7239501\Omega(\alpha)<1.7239501. Together with the lower bound ℓ+>1.7234615\ell_+>1.7234615 of a companion paper, this places ℓ+\ell_+ in an interval of length less than 4.9⋅10−44.9\cdot10^{-4}. The proof exhibits a measure μ\mu on [0,9][0,9] with a piecewise linear density on 3,4813{,}481 rational nodes. Its logarithmic potential is bounded below by a combination of log⁡∣Q∣\log|Q| for 2121 irreducible polynomials QQ, namely xx and polynomials taken from Flammang's work. By a criterion of Smith, μ\mu, normalized to mass 11, is a limit of distributions of conjugates of totally positive algebraic integers, and its integral of log⁡+x\log^{+} x gives the bound. Two separately written programs verify the conditions in ball arithmetic. Both results are also proved in the Lean proof assistant, assuming Smith's theorem and a lower bound for the potential of the arcsine measure, with the checks of the certificate run either as compiled code or by Lean's kernel.

Author comments: Published on Zenodo: https://doi.org/10.5281/zenodo.23544556

A mix of human-written and AI-generated textHuman understanding: all parts
Nov 15, 20269 pages
PDFView work

math.NT — Number Theory

A lower bound for the smallest limit point of the absolute Mahler measure of totally positive algebraic integers

Contributed by Tejasvi Singh Tomar

Let ℓ+\ell_+ be the smallest limit point of the absolute Mahler measures Ω(α)=M(α)1/deg⁡α\Omega(\alpha)=M(\alpha)^{1/\deg\alpha} of totally positive algebraic integers α\alpha. By work of Smyth, ℓ+≤1.7274\ell_+\le1.7274, and the best lower bound was Flammang's ℓ+≥1.722069\ell_+\ge1.722069. We prove that all but finitely many totally positive algebraic numbers α\alpha satisfy Ω(α)>1.7234615\Omega(\alpha)>1.7234615, and that ℓ+>1.7234615\ell_+>1.7234615. We also prove that all but finitely many totally real algebraic numbers β\beta have absolute logarithmic Weil height log⁡Ω(β)>0.2721673\log\Omega(\beta)>0.2721673. The proof adds to Smyth's method of auxiliary functions the logarithmic energy term that Orloski, Talebizadeh Sardari and Smith derived from the integrality of discriminants for the Schur–Siegel–Smyth trace problem. The resulting inequality is verified rigorously by computer, and the lower bounds are also proved in the Lean proof assistant.

Author comments: Published on Zenodo: https://doi.org/10.5281/zenodo.23715956

A mix of human-written and AI-generated textHuman understanding: all parts
Nov 15, 202612 pages
PDFView work

math.NT — Number Theory

Upper and lower bounds for the Schur–Siegel–Smyth trace problem

Contributed by Tejasvi Singh Tomar

The Schur–Siegel–Smyth trace constant C86C_{86} is the lower limit of tr⁡(α)/deg⁡(α)\operatorname{tr}(\alpha)/\deg(\alpha) over totally positive algebraic integers α\alpha. We prove 1.8022225<C86<1.80708091.8022225<C_{86}<1.8070809. For the upper bound we exhibit a measure on [0,6][0,6] that satisfies the hypotheses of Smith's theorem on limits of distributions of conjugates, which we check with the help of 2121 integer polynomials. This improves the upper bounds 1.82161.8216 of Orloski and Talebizadeh Sardari and 1.81172511.8117251 of Pinho. The lower bound comes from the method of Orloski, Talebizadeh Sardari and Smith with fifteen polynomials, three of them of degree 1010 found by McKee and Smyth. It is larger than the bound 1.802201.80220 reported by Giraudin, whose verification evaluates its bounds in floating-point arithmetic with fixed safety margins; ours encloses every rounding error. For each bound, two separately written programs check the certificate in ball arithmetic. Both bounds are also proved in Lean 4, the upper bound under the assumption of Smith's theorem, also in a version in which all checks on the certificates are carried out by Lean's kernel. We also give evidence that certificates of this kind cannot lower the upper bound much further without integer polynomials of high degree.

Author comments: Published on Zenodo: https://doi.org/10.5281/zenodo.23563968

A mix of human-written and AI-generated textHuman understanding: all parts
Nov 15, 202615 pages
PDFView work

Advanced search

Text
Human understanding
Linked formalizations