On Selle's Pythagorean Leg Conjectures: Exact Asymptotic Laws, Quadratic Character Reconstruction, and Arithmetic Dispersion

Lothar Selle conjectured that the ordered even and odd legs of primitive Pythagorean triples,counted with multiplicity, each satisfy a(n)/n → 1/π. We prove instead a(n) ∼ π2n/ log n,with two-term counting asymptotics and an explicit asymptotic separation of the two sequences.Prime-class restrictions produce linear laws with slopes 2π and π. The quotient ζ(s)/L(s, χ)connects these multiplicities to exact quadratic-character reconstruction and to oscillations arisingfrom noncancelled beta zeros. We establish polylogarithmic query bounds, finite error-correctioncertificates, and arithmetic dispersion estimates for specified sectors. Analytic countermodelsand a paired-residue identity identify limitations of stronger uniform bounds. At cutoff exponent3/2 we prove a rectangular collision estimate and almost-everywhere list reconstruction with listexponent 1/3 + ε. An exact masked factorization formula and a projected endpoint criterion isolatethe remaining balanced sector. Quadratic-polynomial families and adaptive competitor estimatesexclude further sectors. A disjoint-matching reduction and an exact masked long-tensor identityseparate repeated-prime contributions from a high-degree centered residual. A full unthresholdedpower saving would imply a uniform fixed-width zero-free strip for quadratic Dirichlet functions;a thresholded power saving would still imply a uniform polylogarithmic least-nonresidue bound.Small kernels are controlled unconditionally on a growing subexponential range. Residual divisorfibres admit uniform dispersion estimates, which transfer to adaptive matchings via a dependenceinequality. An arithmetic matching construction shows that randomized factor splitting alonecannot guarantee the required contraction. Mixed-kernel deletion gives bounded residual listsand exact short-cycle rigidity. Complete bipartite subgraphs of actual cofactor matchings admita prime-switching compression; weighted arithmetic-curve estimates and low-energy structureconstrain these blocks. Extensive prescribed-modulus matchings and parity-rank obstructionsdistinguish insufficient observations from full-pool agreement. A bounded Walsh detector localizesthe remaining arithmetic estimate, with a sharp distinction between polynomially small pointwiseerror and density-zero precision. A translation-uniform curve bound retains the subexponentialinterval scale and gives a weighted covering criterion for the polynomial band. Unique reconstructionat exponent 3/2 remains open.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-19
DOI
https://doi.org/10.5281/zenodo.24381448
Primary Topic
Analytic Number Theory Research
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

On Selle's Pythagorean Leg Conjectures: Exact Asymptotic Laws, Quadratic Character Reconstruction, and Arithmetic Dispersion

Tony Newton
Zenodo (CERN European Organization for Nuclear Research)
Analytic Number Theory Research
preprint

On Selle's Pythagorean Leg Conjectures: Exact Asymptotic Laws, Quadratic Character Reconstruction, and Arithmetic Dispersion

Tony Newton
preprint en

Abstract

Lothar Selle conjectured that the ordered even and odd legs of primitive Pythagorean triples,counted with multiplicity, each satisfy a(n)/n → 1/π. We prove instead a(n) ∼ π2n/ log n,with two-term counting asymptotics and an explicit asymptotic separation of the two sequences.Prime-class restrictions produce linear laws with slopes 2π and π. The quotient ζ(s)/L(s, χ)connects these multiplicities to exact quadratic-character reconstruction and to oscillations arisingfrom noncancelled beta zeros. We establish polylogarithmic query bounds, finite error-correctioncertificates, and arithmetic dispersion estimates for specified sectors. Analytic countermodelsand a paired-residue identity identify limitations of stronger uniform bounds. At cutoff exponent3/2 we prove a rectangular collision estimate and almost-everywhere list reconstruction with listexponent 1/3 + ε. An exact masked factorization formula and a projected endpoint criterion isolatethe remaining balanced sector. Quadratic-polynomial families and adaptive competitor estimatesexclude further sectors. A disjoint-matching reduction and an exact masked long-tensor identityseparate repeated-prime contributions from a high-degree centered residual. A full unthresholdedpower saving would imply a uniform fixed-width zero-free strip for quadratic Dirichlet functions;a thresholded power saving would still imply a uniform polylogarithmic least-nonresidue bound.Small kernels are controlled unconditionally on a growing subexponential range. Residual divisorfibres admit uniform dispersion estimates, which transfer to adaptive matchings via a dependenceinequality. An arithmetic matching construction shows that randomized factor splitting alonecannot guarantee the required contraction. Mixed-kernel deletion gives bounded residual listsand exact short-cycle rigidity. Complete bipartite subgraphs of actual cofactor matchings admita prime-switching compression; weighted arithmetic-curve estimates and low-energy structureconstrain these blocks. Extensive prescribed-modulus matchings and parity-rank obstructionsdistinguish insufficient observations from full-pool agreement. A bounded Walsh detector localizesthe remaining arithmetic estimate, with a sharp distinction between polynomially small pointwiseerror and density-zero precision. A translation-uniform curve bound retains the subexponentialinterval scale and gives a weighted covering criterion for the polynomial band. Unique reconstructionat exponent 3/2 remains open.

Zenodo (CERN European Organization for Nuclear Research)
Analytic Number Theory Research
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon