pith. sign in

arxiv: 2604.25446 · v1 · submitted 2026-04-28 · 🧮 math.NT · math.CO· math.DS

The Divisor Function along a Deterministic Orbit and the Emergence of Ladders

Marco Mantovanelli This is my paper

Pith reviewed 2026-05-07 14:54 UTC · model grok-4.3

classification 🧮 math.NT math.COmath.DS
keywords divisor functiondeterministic orbitdivisor laddersanti-concentrationstructure-versus-randomnessorbit lengtharithmetic progressionsdyadic scales
0
0 comments X

The pith

The length of the orbit under repeated subtraction of the divisor function is asymptotically x/log x, assuming no energy-saturating divisor ladders form.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper examines the length a(x) of the sequence generated by repeatedly subtracting the number of divisors tau(n) from the current term, starting from a large integer x. Although the average size of tau suggests a(x) should be on the order of x/log x, the strong correlations within the orbit defy standard methods for studying multiplicative functions. The key innovation is a structure-versus-randomness dichotomy showing that the orbit either mixes divisor values across scales or forms special structures called divisor ladders consisting of long near-arithmetic progressions with nearly constant tau. This reduces the asymptotic question for a(x) to whether such ladders can become energy-saturating. Under the assumption that they cannot, the expected length a(x) approximately x/log x holds. Unconditionally, large divisor values are shown to be negligible on dyadic segments of the orbit and any obstruction localizes to a single scale.

Core claim

The analysis of the orbit length a(x) under the deterministic recursion n to n minus tau(n) reduces to a single structural obstruction consisting of energy-saturating divisor ladders. Under an anti-concentration hypothesis that rules out such ladders, a(x) satisfies a(x) asymptotically equivalent to x/log x. Unconditionally, large values of tau(n) are negligible on dyadic scales along the orbit, and any potential obstruction must occur at a single divisor scale where tau(n) is comparable to log n.

What carries the argument

The structure-versus-randomness principle for the distribution of tau on dyadic scales along the orbit, which forces either divisor mixing or the formation of divisor ladders (long near-arithmetic progressions where tau remains essentially constant).

If this is right

  • Under the anti-concentration hypothesis, a(x) is asymptotically x/log x.
  • Large values of tau(n) contribute negligibly along the orbit when measured on dyadic scales.
  • Any obstruction to the asymptotic must concentrate at one divisor scale where tau(n) is about log n.
  • Under an additional phase-rigidity hypothesis, the orbit can contain long near-arithmetic progressions with tau essentially constant.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The framework may extend to iterations of other multiplicative functions such as the sum-of-divisors function.
  • Direct computation of orbits starting from moderately large x could test whether near-ladders appear frequently enough to challenge the hypothesis.
  • This deterministic setting offers a test case for when arithmetic progressions in sets defined by multiplicative properties can obstruct average-order behavior.

Load-bearing premise

The anti-concentration hypothesis that rules out energy-saturating divisor ladders along the orbit.

What would settle it

An explicit numerical example or construction of an orbit segment that forms a long near-arithmetic progression where tau stays nearly constant at a scale high enough to saturate the total energy subtracted would disprove the claimed asymptotic.

Figures

Figures reproduced from arXiv: 2604.25446 by Marco Mantovanelli.

Figure 1
Figure 1. Figure 1: Orbit length a(n) for n ≤ 104 compared with n/ log n and n/(log n + log log n). As shown in view at source ↗
Figure 2
Figure 2. Figure 2: Normalized ratios of a(n) compared to heuristic models. The first-order approximation lies below 1, while the refined model is closer to 1 but slightly above. 3 Main Results We study the orbit defined by n0(x) = x, nj+1(x) = nj (x) − τ (nj (x)), and its length a(x) := min{k ≥ 0 : nk(x) ≤ 0}. Our goal is to understand the asymptotic behavior of a(x) as x → ∞. 3.1 Unconditional baseline bounds We begin with … view at source ↗
Figure 3
Figure 3. Figure 3: Averaged energy distribution of τ (mi) along random progressions for N = 108 . The distribution is spread over a wide range and shows no significant concentration near the typical scale T ≈ log N view at source ↗
Figure 4
Figure 4. Figure 4: Maximal single-scale energy concentration along the orbit as a view at source ↗
read the original abstract

We study the deterministic recursion $n_{j+1} = n_j - \tau(n_j)$, where $\tau(n)$ denotes the divisor function, and the associated orbit length $a(x)$. Heuristics based on the average order of $\tau(n)$ suggest that $a(x) \asymp x / \log x$, but the strong dependence along the orbit places the problem outside the scope of existing methods for multiplicative functions. We develop a deterministic framework that reduces the analysis of the orbit to the distribution of $\tau(n_j)$ on dyadic scales. This yields a structure-versus-randomness principle: either the orbit exhibits divisor mixing, or it develops strong additive structure. In the latter case, we show, under a phase-rigidity hypothesis, that the orbit contains long near-arithmetic progressions along which $\tau(n)$ is essentially constant, which we call divisor ladders. Our main result reduces the asymptotic behavior of $a(x)$ to a single structural obstruction. Assuming an anti-concentration hypothesis that rules out energy-saturating divisor ladders, we obtain $a(x) \asymp x / \log x$. The paper also establishes several unconditional structural results, including that large values of $\tau(n)$ are negligible on dyadic scales and that any potential obstruction must occur at a single divisor scale $\tau(n) \asymp \log n$.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

0 major / 2 minor

Summary. The paper studies the deterministic recursion n_{j+1} = n_j - τ(n_j) and the associated orbit length a(x). It develops a deterministic framework reducing the analysis of the orbit to the distribution of τ(n_j) on dyadic scales. This yields a structure-versus-randomness principle: either the orbit exhibits divisor mixing, or it develops strong additive structure. Under a phase-rigidity hypothesis, the latter case produces long near-arithmetic progressions along which τ(n) is essentially constant, termed divisor ladders. The main result reduces the asymptotic behavior of a(x) to a single structural obstruction. Assuming an anti-concentration hypothesis that rules out energy-saturating divisor ladders, the paper obtains a(x) ≍ x / log x. Unconditionally, it shows that large values of τ(n) are negligible on dyadic scales and that any potential obstruction must occur at a single divisor scale τ(n) ≍ log n.

Significance. If the stated anti-concentration hypothesis holds, this work would confirm the heuristic asymptotic a(x) ≍ x / log x via a deterministic structure-versus-randomness approach that accounts for the strong dependencies along the orbit, which lie outside standard methods for multiplicative functions. The reduction of the problem to a single structural obstruction is a clear strength, as it isolates the remaining difficulty and focuses future work. The unconditional results on the negligibility of large τ values and the single-scale nature of any obstruction are valuable independent contributions. The framework and the concept of divisor ladders may prove useful for analyzing other multiplicative functions in recursive or deterministic settings.

minor comments (2)
  1. The notation a(x) for the orbit length is used in the abstract without an explicit definition at first appearance; this should be defined clearly in the introduction or statement of the main result.
  2. The term 'energy-saturating divisor ladders' is referenced in the abstract in connection with the anti-concentration hypothesis; a brief inline definition or forward reference to the precise formulation in the body would improve readability for readers unfamiliar with the new terminology.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for their positive and insightful summary of our work, as well as for the favorable significance assessment and recommendation of minor revision. The report does not raise any specific major comments or criticisms, so we have no point-by-point rebuttals to provide. We will make any minor editorial adjustments as needed in the revised version.

Circularity Check

0 steps flagged

No circularity: conditional reduction to explicit hypothesis

full rationale

The paper derives a structure-versus-randomness dichotomy for the orbit under n_{j+1}=n_j - τ(n_j), shows unconditional negligibility of large τ values on dyadic scales, and isolates any obstruction to a single scale τ(n) ≍ log n. The main asymptotic a(x) ≍ x/log x is obtained only after assuming an explicit anti-concentration hypothesis that rules out energy-saturating divisor ladders. This is a standard conditional result; the derivation does not reduce any claimed prediction or theorem to its own fitted inputs, self-citations, or definitions by construction. No load-bearing step relies on renaming, ansatz smuggling, or uniqueness imported from prior author work. The argument is self-contained against external benchmarks once the hypothesis is granted.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 1 invented entities

The central claim rests on two hypotheses introduced for the structure case and the anti-concentration assumption, plus the new notion of divisor ladders; no free parameters are stated.

axioms (2)
  • ad hoc to paper Phase-rigidity hypothesis
    Invoked to show that strong additive structure produces long near-arithmetic progressions along which τ(n) is essentially constant.
  • ad hoc to paper Anti-concentration hypothesis ruling out energy-saturating divisor ladders
    Assumed to eliminate the structural obstruction and obtain the main asymptotic a(x) ≍ x / log x.
invented entities (1)
  • Divisor ladders no independent evidence
    purpose: Long near-arithmetic progressions along the orbit where τ(n) is essentially constant
    Introduced as the concrete form of the structural obstruction that must be ruled out.

pith-pipeline@v0.9.0 · 5547 in / 1383 out tokens · 71649 ms · 2026-05-07T14:54:26.503122+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

9 extracted references · 9 canonical work pages

  1. [1]

    Apostol.Introduction to Analytic Number Theory

    Tom M. Apostol.Introduction to Analytic Number Theory. Undergrad- uate Texts in Mathematics. Springer, 1976

    work page 1976

  2. [2]

    The concentra- tion of divisors.Inventiones Mathematicae, 232:1019–1067, 2023

    Kevin Ford, Ben Green, and Dimitris Koukoulopoulos. The concentra- tion of divisors.Inventiones Mathematicae, 232:1019–1067, 2023

    work page 2023

  3. [3]

    Mangerel

    Ohad Klurman and Alexander P. Mangerel. Multiplicative functions in short arithmetic progressions.Mathematika, 69(2):327–364, 2023

    work page 2023

  4. [4]

    Multiplicative functions in short intervals.Annals of Mathematics, 183(3):1015–1056, 2016

    Kaisa Matom¨ aki and Maksym Radziwi l l. Multiplicative functions in short intervals.Annals of Mathematics, 183(3):1015–1056, 2016

    work page 2016

  5. [5]

    An averaged form of chowla’s conjecture.Algebra & Number Theory, 9(9):2167–2196, 2015

    Kaisa Matom¨ aki, Maksym Radziwi l l, and Terence Tao. An averaged form of chowla’s conjecture.Algebra & Number Theory, 9(9):2167–2196, 2015

    work page 2015

  6. [6]

    The on-line encyclopedia of integer sequences, sequence a155043.https://oeis.org/A155043

    OEIS Foundation Inc. The on-line encyclopedia of integer sequences, sequence a155043.https://oeis.org/A155043. Accessed: 2026-04-28

    work page 2026

  7. [7]

    The chowla conjecture and the entropy decrement argu- ment.Forum of Mathematics, Pi, 4:e1, 2016

    Terence Tao. The chowla conjecture and the entropy decrement argu- ment.Forum of Mathematics, Pi, 4:e1, 2016

    work page 2016

  8. [8]

    The structure of correlations of mul- tiplicative functions at almost all scales.Algebra & Number Theory, 13(7):1535–1587, 2019

    Terence Tao and Joni Ter¨ av¨ ainen. The structure of correlations of mul- tiplicative functions at almost all scales.Algebra & Number Theory, 13(7):1535–1587, 2019. 35

    work page 2019

  9. [9]

    American Mathematical Society, 3rd edition, 2015

    G´ erald Tenenbaum.Introduction to Analytic and Probabilistic Num- ber Theory, volume 163 ofGraduate Studies in Mathematics. American Mathematical Society, 3rd edition, 2015. 36

    work page 2015