Matching works

2 works

math.NT — Number Theory

On Bounds for Reciprocal Sums and Residues in Collatz Orbits, and Their Consequences

Contributed by Behzad Nikzad, Karl Frinkle, Fatemeh Bagherzadeh

We prove uniform bounds for reciprocal sums and residue products along Collatz paths. Let F\mathcal F be a finite nonrepeating shortcut path whose input states are greater than 11, let RF\mathcal R_{\mathcal F} be the sum of the reciprocals of its odd inputs, and let ρF\rho_{\mathcal F} be its finite-path residue. Then RF<1,ρF<43.\mathcal R_{\mathcal F}<1, \qquad \rho_{\mathcal F}<\frac{4}{3}. For the first-arrival trajectory of a terminating positive integer nn, these inequalities give R(n)<1,ρ(n)=2E(n)3O(n)n<43,\mathcal R(n)<1, \qquad \rho(n)=\frac{2^{E(n)}}{3^{O(n)}n}<\frac{4}{3}, where E(n)E(n) and O(n)O(n) are the division and odd-operation counts. More generally, when each odd value greater than 11 is counted once, the corresponding reciprocal-sum and residue bounds hold for every forward orbit, without a termination assumption. The proof combines verified finite height-delay records and residue bounds, canonical-block reciprocal estimates, and an exact finite count organized by gap brackets. Gap brackets, closely related to parity vectors, record the divisions by two between successive odd inputs and organize the finite counting argument; together with a related coordinate representation, they also yield exact formulas for reconstructing finite trajectories. After taking base-22 logarithms, the bound ρF<4/3\rho_{\mathcal F}<4/3 leaves an uncertainty of less than 1/21/2 in the relation between the even- and odd-operation counts. Since these counts are integers, either count is determined exactly by the other count and the path endpoints. We obtain nearest-integer restrictions on the changes in EE and OO between adjacent integers, apart from explicit small exceptions, and prove that adjacent terminating integers of equal height have identical operation counts. Thus every equal-height streak lies in a single operation-count class. We further introduce the charge λ=E−2O\lambda=E-2O and associated height and charge slice functions to study the persistence and eventual break of equal-height streaks. We distinguish class records, which are the least starting integers attaining specified values, from delay records, which attain new extrema relative to all smaller starting integers. The resulting record theory shows that λ\lambda-delay records form a subsequence of the odd-count delay records, which form a subsequence of the common division-count and height-delay list. On the class side, the nonpositive charge-class records lie among the odd-count class records, which lie among the division-count class records, which in turn lie among the height-class records. The corresponding hierarchies also hold for first-arrival paths to a common endpoint zz when z=1z=1 or when z>2z>2 is nonperiodic under the shortcut map.

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

math.NT — Number Theory

Minimal recurrences for binomial power sums

Contributed by Khai-Hoan Nguyen-Dang

For every positive integer rr, we prove that the least order of a polynomial-coefficient recurrence for Fr(n)=∑k=0n(nk)rF_r(n)=\sum_{k=0}^n\binom nk^r is ⌊(r+1)/2⌋\lfloor(r+1)/2\rfloor. This establishes the unrestricted minimal-order assertion arising from Franel's work of 1894--1895. We also determine the least order ⌊r/2⌋\lfloor r/2\rfloor, for r≥2r\geq2, of the alternating sums (−1)n∑k=02n(−1)k(2nk)r(-1)^n\sum_{k=0}^{2n}(-1)^k\binom{2n}{k}^r. The lower bounds follow from real moment representations: every nonzero singularity of the representing measure forces a root of the leading characteristic polynomial of the recurrence. A common reflection argument gives telescoping recurrences attaining both bounds. For the ordinary sums, we combine the deformation of Straub and Zudilin with a shifted prime-power congruence to prove that the minimal shift operator is irreducible over $\C(n)$.

A mix of human-written and AI-generated textHuman understanding: some partsAp\'ery limitsFranel numbersFranel’s recurrence problembinomial power sums
Nov 02, 202615 pages
PDFView work

Advanced search

Text
Human understanding
Linked formalizations