Search arXivSearch

arXiv · 2606.07735

Arithmetic Symmetry in Ideal Prouhet-Tarry-Escott Solutions

Abstract

Motivated in part by anomaly cancellation for integral charge spectra in chiral gauge theory, we study the symmetric locus in the ideal degree-three Prouhet-Tarry-Escott problem. A symmetric integer solution is one whose entries are paired about a common center $c\in \frac12\mathbb Z$. This symmetry reduces the problem to a sum-of-two-squares equation, $x^2+y^2=u^2+v^2$, in integer variables, subject to the appropriate parity conditions. Thus the problem is governed by representations as sums of two squares. For the full symmetric locus, let $N_{\mathrm{sym}}(H)$ denote the number of nontrivial symmetric integer solutions of height at most $H$, counted with unordered multiset conventions and summed over the admissible centers. Then \begin{align*} N_{\mathrm{sym}}(H) = \frac{4\log 2}{3π^2}H^3\log H+O(H^3). \end{align*} The logarithmic enhancement comes from the second moment of the sum-of-two-squares representation function. In particular, the symmetric locus is larger than one would expect from the naive $H^3$ degree-weighted box-counting scale alone. This asymptotic identifies a large arithmetically structured subfamily of the ideal degree-three solution space, and suggests that paired anomaly-free integral charge spectra reflect a fundamental number-theoretic structure.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yu-Dai Tsai, Junseok Lee, Fuminobu Takahashi. 2026-06-05. Arithmetic Symmetry in Ideal Prouhet-Tarry-Escott Solutions. https://arxiv.org/abs/2606.07735

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Asymptotic density of k-almost primes

Landau's well known asymptotic formula $$N_k(x):=\ \mid\{n\leq x : Ω(n)=k\}\mid \ \sim \left( \frac{x}{\log x} \right) \frac{(\log\log x)^{k-1}}{(k - 1)!}\ \ (x \rightarrow \infty),$$ which also holds for $$π_k(x):=\ \mid\{n\leq x : ω(n)=k\}\mid,$$ is known to be fairly poor for $k > 1$, and when $k$ is allowed to tend to infinity with $x$, the study of $N_k(x)$ and $π_k(x)$ becomes very technical [1, Chapter II.6, $§$ 6.1, p.200]. I hope to show that the method described below provides not only a more accurate approach, but rather increases in its asymptotic accuracy as $k$ tends to infinity.

math.NT

Transcendence Meets Normality: Construction of Transcendentally Normal Numbers

In this work, we study real numbers $x$ for which $p(x)$ is (absolutely) normal for every non-constant integer-valued polynomial $p$. We call such numbers transcendentally normal. We prove that almost every real number is transcendentally normal and provide an explicit construction of such a number, based on Sierpinski's covering method and novel ideas involving the so-called stretch function. In the next step, we transform this construction into an algorithm that computes the digits of a t-normal number recursively in all integer bases. Moreover, we extend our covering approach to construct and compute LIL-normal numbers whose discrepancies are of the order predicted by the law of the iterated logarithm. We also take the opportunity to discuss several interesting open problems.

math.NT