Pith. sign in

REVIEW 1 major objections 3 minor 9 references

Mersenne Representation, the Conolly Sequence, and Soliton Profiles over Finite Fields

T0 review · 1 major / 3 minor · reviewed 2026-08-01 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read The Mersenne representation of integers proves a conjectured sequence identity and reconstructs finite-field solitons as integer jump counts.

desk verdict Proves a real OEIS conjecture with a reusable Mersenne-language machine; the imported BBS premise is disclosed and not a deal-breaker. read the letter →

arxiv 2607.22202 v1 pith:3YSNLI26 submitted 2026-07-24 math.CO math.DSnlin.SI

Fumitaka Yura This is my paper · ORCID
classification math.COmath.DSnlin.SI MSC 11B8305A1537B1537K4037K60
keywords Mersennerepresentationmeta-FibonaccisequencesA055938A080578Conollysequenceparentmaptaufunctionfinite-fieldbox-ballsystem
topics The Collatz Conjecture
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

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

The reading

This paper builds a number system — the Mersenne representation, using digits 0, 1, 2 with weights 2^k − 1 — and shows that its word-level structure carries two seemingly separate results. First, the successor rule on the words that contain a digit 2 proves the identity A080578(n) = A055938(n−1) + 2 for every n ≥ 2, a relation that has stood as a conjecture in the standard integer-sequence database. Second, the same counting machinery (a parent map that deletes the lowest digit, a counting function that is a shifted Conolly sequence, and a Mersenne tau function) is used to build a global integer-valued profile σ; a window-counting theorem says its jumps are 0 or 1 and a jump occurs exactly when the sum over a symmetric window is 2 modulo 3. Reducing σ modulo 3 verifies the traveling-wave equation of a finite-field box-ball system, reproducing the known one-soliton family with velocity 2^(h+1)/(2^(h+1)−1). The value is that a single combinatorial construction turns a conjectural sequence relation into a theorem and makes an integrable-systems solution an explicit counting function.

What carries the argument

The central machinery is the Mersenne representation and its two derived operations: the parent map π(r) = r − Z(r), which acts on the value side as deletion of the lowest Mersenne digit, and the counting function Z(r) counting binary-side values below r (equal to a shifted Conolly sequence). The parent iterates partition the integers into truncation blocks [T_ℓ(r), T_ℓ(r+1)) via T_ℓ(r) = r + 2(2^ℓ − 1)Z(r); the truncation remainder ρ_ℓ(µ) and the Mersenne tau function G_ℓ(µ) = Σ_{a≥ℓ+1} π^a(µ) supply the digit-recovery and diagonal-defect formulas. The decisive identity for the BBS application is the diagonal tau defect Z(π^{ℓ−1}(µ−1)) − 2Z(π^ℓ(µ)) = ⌊ρ_ℓ(µ)/2^ℓ⌋, which converts a window su

What would settle it

Search for a counterexample: for a fixed depth h (e.g., h=3), build σ from the front formula and reflected closure, compute D and W over the whole support, and test whether D(ξ) ∈ {0,1} and D(ξ)=1 ⟺ W(ξ) ≡ 2 (mod 3) for every ξ. A single violation would refute Theorem 12.5 and the finite-field traveling-wave claim. Independently, a concrete check of A080578(n) = A055938(n−1) + 2 for all n up to, say, 10^6 would confirm or refute the sequence identity.

Watch

Extended reading notes

Core claim

Framing every integer as a Mersenne word — digits 0,1,2 over weights 2^k − 1, with a 2 forcing all lower digits to 0 — yields two results at once. A successor transformation on the nonbinary sublanguage enumerates A055938 and gives the difference rule y_{n+1} − y_n = 3 − 2χ(n); this proves the conjectural identity A080578(n) = A055938(n−1) + 2 for n ≥ 2, and shows the binary-side counting function Z equals a shifted Conolly sequence. The same parent map π = r − Z, conjugate to digit deletion, builds an integer profile σ; the window-counting theorem says D(ξ) ∈ {0,1} and D(ξ)=1 ⟺ σ(ξ+K) − σ(ξ−Ω) ≡ 2 (mod 3). Since the finite-field polynomial M(a,b) detects 2 in its second argument, σ mod 3 sa

Load-bearing premise

The finite-field BBS conclusions rest on the modelling premise, taken from earlier work, that the polynomial M(a,b) = 2(a²+ab+b²+a+b) over F₃ plays the algebraic role of the maximum operation in the box–ball system; if that correspondence misrepresents the intended dynamics, the soliton claims would not follow even though all the integer-sequence theorems stand independently.

Editorial extensions

If this is right

  • The identity A080578(n) = A055938(n−1) + 2 is a theorem, not a conjecture: it follows from a word-level successor argument.
  • Three integer sequences (A055938, A080578, A046699) are unified under one representation; the counting function of the binary side is exactly the shifted Conolly sequence.
  • The finite-field BBS one-soliton family has an explicit integer reconstruction: the soliton profile is a jump-counting function with D(ξ) ∈ {0,1}.
  • The traveling-wave equation for these solitons reduces to checking a mod-3 window count, so the evolution rule is a purely combinatorial counting statement.
  • The Mersenne tau function gives an explicit integer tau function whose front values are the tau rows, providing a discrete analogue of the standard box–ball tau function.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The same successor/truncation machinery could be used to attack other conjectural identities in the meta-Fibonacci literature, such as relations among A046699, A005187, and A079559, without importing external relations as hypotheses.
  • If the window-counting mechanism persists under collisions, it would give an integer-level explanation of multi-soliton scattering in the finite-field BBS; the paper does not prove this, but its profile construction is the natural starting point.
  • The author's suggested q-extension, replacing 2^k − 1 by [k]_q = (q^k − 1)/(q − 1), offers a testable generalization: one could check numerically whether the parent map and truncation blocks still yield a window-counting theorem modulo q−1 or some other modulus.
  • The identification of soliton profiles with jump-counting functions suggests a broader bridge: number-system word languages can serve as exact schemas for constructing and proving integrable cellular-automaton solutions, potentially in higher rank.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

1 major / 3 minor

Summary. The paper introduces a Mersenne representation of nonnegative integers: digits 0, 1, 2, where the digit 2 forces all lower digits to be 0. After removing leading zeros, every nonnegative integer has a unique Mersenne word. The paper splits this language into a binary sublanguage, whose values form A005187, and a nonbinary sublanguage, whose values form A055938. A local successor transformation on the nonbinary sublanguage gives the increasing enumeration of A055938 and leads to a proof of the OEIS-conjectural identity A080578(n) = A055938(n-1) + 2 for n at least 2 (Theorem 4.1). The paper then develops the parent map, truncation blocks, quotients and remainders, and a Mersenne tau function, proving digit-reconstruction formulas and a diagonal tau-defect identity. In the second half, these structures are used to construct a global integer-valued profile sigma from parent iterates, extended by reflection, and to prove an integer window-counting theorem: the forward difference D(xi) is 0 or 1, and D(xi) = 1 iff the window sum W(xi) is 2 modulo 3 (Theorem 12.5). Reduction modulo 3 yields the claimed finite-field BBS traveling-wave solutions, and a tau-function realization is given. The BBS application explicitly relies on the correspondence established in the author's earlier paper [1].

Significance. If correct, the paper makes a solid combinatorial contribution. Theorem 4.1 settles a relation that the OEIS records as conjectural, and it does so from a genuine word-structure argument. The parent-map, truncation, and tau-function identities are explicit and independently checkable; the finite-depth profile and the window-counting theorem are constructive and concrete. The paper is honest about its scope: the finite-field BBS interpretation is conditional on equations imported from [1], and multi-soliton collisions are explicitly not treated. The combinatorial core, Sections 2 through 10, is self-contained and appears sound. The main weakness is a proof-dependency issue: one identity that is load-bearing for the window-counting theorem is ultimately sourced from an unproved OEIS relation, and the paper's independent proof in Remark 7.2 covers only part of what is needed.

major comments (1)
  1. [Section 4.2, Cor. 5.3, Cor. 9.4, Theorem 9.5, Remark 7.2] The identity y_n = 2Z(n)+n-1 is used in the proof of Corollary 9.4 and therefore in Theorem 9.5 and the window-counting theorem. As written, this identity follows from Corollary 4.3, whose proof relies on Cloitre's relation (A080578(n)-n)/2 = A046699(n), imported from the OEIS entry in Section 4.2. Remark 7.2 gives an intrinsic proof only of Z(n) = z_{n+1}; it does not independently prove the y-form. Since Theorem 12.5 is a central claim, please add a direct proof of y_n = 2Z(n)+n-1 from Proposition 3.3 and Proposition 5.2, or include a proof of the Cloitre relation. Without this, a load-bearing step rests on an external OEIS attribution rather than on the paper's own machinery.
minor comments (3)
  1. [Notation] The two sublanguages J and its complement are visually almost indistinguishable in many displayed formulas, for example in Proposition 2.4, Proposition 3.6, and the proof of Theorem 9.5. This creates real ambiguity about which side has a one-point truncation block. Please use clearly distinct symbols throughout.
  2. [Section 13.3] In the displayed formula for the right exterior, '9/4 xi' should read '(9/4)xi' to avoid the impression that 9/(4xi) is intended.
  3. [Section 11.1 and Cor. 13.1] The paper's BBS conclusions are conditional on the polynomial-BBS correspondence established in [1], especially the equivalence between the U-variable equation (3) and the S-variable traveling-wave equation (8). This is explicitly disclosed, and the combinatorial theorems do not depend on it, but a sentence in the abstract or conclusion clarifying that the finite-field part verifies the equation imported from [1] would be useful.

Circularity Check

0 steps flagged · score 2.0 of 10

No circular derivation: Theorem 4.1 is proved from the successor structure, and the finite-field BBS result depends on a disclosed external prior result rather than on the target claim.

full rationale

The central combinatorial theorem (Theorem 4.1) is not circular: the paper defines a_n = A055938(n-1)+2 and proves that this sequence satisfies the defining recursive increment rule of A080578. The target identity is never used as an input to its own proof; it is derived from the successor map and then identified with A080578 by uniqueness of the recursion. The later Conolly representations, Corollary 4.3 and the first proof of Corollary 5.3, route through Cloitre's relation taken from the same OEIS neighborhood, but Remark 7.2 supplies an independent frequency/plateau proof of the load-bearing identity Z(n)=z_{n+1}, so the paper does not ultimately depend on that sibling relation. In the finite-field BBS part, the paper constructs an explicit integer profile from Mersenne parent iterates and proves the window-counting theorem, which is then reduced modulo 3 to verify the imported traveling-wave equation (8). The bridge from (8) back to the U-variable BBS equation (3) is explicitly attributed to [1] and is a scoped external dependency, not a circular use of the present paper's conclusion. No fitted parameter is renamed as a prediction, no ansatz is smuggled in via self-citation, and no uniqueness theorem from the authors is invoked to forbid alternatives. The combinatorial results of Sections 2-12 are self-contained and would stand even if the finite-field modeling premise were questioned. The score of 2 reflects only the presence of minor self-citation/external-prior dependencies, not actual circularity.

Assumptions & free parameters 2 free parameters · 5 assumptions · 2 invented entities

The paper's combinatorial core (Sections 2–10) is essentially parameter-free: it starts from a representation that is proven bijective (Prop 2.2) and derives sequences/maps without fitting. The ledger's free parameters are confined to the BBS application: the hand-chosen polynomial M (inherited from [1]) and the family index h. External assumptions are: the OEIS characterizations of A005187/A055938/A079559, Cloitre's Conolly relation (with an independent proof offered later for the load-bearing case), the [1] polynomial-BBS equations, and standard results (Legendre's formula, Conolly frequency law). No new physical entities are introduced; the 'invented' mathematical objects are explicitly constructed and proven, so the graviton problem does not apply.

free parameters (2)
  • Polynomial M(a,b) over F₃ = M(a,b) = 2(a² + ab + b² + a + b) in F₃
    Hand-chosen algebraic proxy for the maximum operation, inherited from the author's [1]; not fitted to data. It defines the target traveling-wave equation (8) for the BBS application; the paper verifies the profile against (8) rather than deriving M.
  • Depth parameter h (and derived K = 2^{h+1}−1, Ω = 2^{h+1}) = h arbitrary nonnegative integer
    Family index for the one-soliton construction, not fitted: K and Ω are derived from h in closed form, and the window-counting theorem is proven for every h. Listed for exhaustiveness; carries no fitting burden.
assumptions (5)
  • domain assumption A005187 is exactly the set of finite sums of distinct Mersenne weights 2^k−1; A055938 is its complement in Z≥0; A079559 is the characteristic sequence of A005187.
    Used in §2.2–3 to identify the binary/nonbinary value sets C( J) and C(J) with the named OEIS sequences. The paper cites [8] (OEIS) for these characterizations rather than proving them.
  • domain assumption Cloitre's relation: (A080578(n) − n)/2 = A046699(n) for n ≥ 2, where A046699 is the Conolly sequence.
    Invoked in §4.2 to derive Corollary 4.3 and the first proof of Corollary 5.3; attributed to Cloitre via the OEIS entry [9] and the hiccup-sequence framework [5]. The load-bearing Corollary 5.3 is later given an independent frequency-based proof in Remark 7.2.
  • domain assumption The polynomial M(a,b) over F₃ serves as the algebraic replacement of max, and equations (3), (5), (8) are the correct finite-field BBS equations.
    Inherited from [1]; used in §11–13 to define the traveling-wave equation (8) that the integer profile σ is verified against. The paper cites [1] for the correspondence between the U- and S-variable equations; it does not re-derive the polynomial-BBS modeling.
  • domain assumption Conolly frequency law: each positive integer m occurs exactly 1 + ν₂(m) times in the Conolly sequence (after removing the first term).
    Used in Remark 7.2 as the independent basis for Z(n) = z_{n+1}; attributed to [4] (Erickson–Isgur–Jackson–Ruskey–Tanny). External but cited.
  • standard math Legendre's formula ν₂(m!) = m − s₂(m), where s₂ is the binary digit sum.
    Standard number theory used in Proposition 7.1 to identify π(b_m) with A011371; cited to Hardy–Wright [6].
invented entities (2)
  • Mersenne tau function G_ℓ(µ) = Σ_{a≥ℓ+1} π^a(µ) independent evidence
    purpose: Encodes parent orbits; row differences recover parent iterates, the counting function Z, and the Mersenne digits (Corollary 9.2); front values become the BBS traveling-wave tau function (§13.2).
    Fully defined as finite tail sums (Section 9); every value is explicitly computable, and the digit-recovery/diagonal-defect identities are proven in-paper and spot-checked. It is a constructed object with internal proof, not a postulated entity requiring external evidence.
  • Global integer-valued profile σ and tau function G (front + reflected closure + exterior R) independent evidence
    purpose: Integer reconstruction of the F₃ BBS one-solitons: σ is defined from parent iterates, reflected to satisfy σ(ξ)+σ(d−ξ)=R, and reduced mod 3 to satisfy (8).
    Explicit piecewise definition from parent iterates; Theorem 12.5 (D(ξ)=1 ⟺ W(ξ)≡2 mod 3 for every ξ) is proven, so the entity is verified against an externally stated equation (8) rather than postulated. Unlike a new force or particle, no physical external evidence is required.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Mersenne Representation, the Conolly Sequence, and Soliton Profiles over Finite Fields." pith.science (2026). https://pith.science/paper/3YSNLI26

@misc{pith2026260722202,
  author       = {Pith},
  title        = {Pith review of: Mersenne Representation, the Conolly Sequence, and Soliton Profiles over Finite Fields},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/3YSNLI26}},
  note         = {Machine review of arXiv:2607.22202}
}
read the original abstract

We study the Mersenne representation of nonnegative integers and its decomposition into the binary and nonbinary sides. The nonbinary values form A055938, and their successor structure gives a direct proof of the relation between A055938 and A080578 that is recorded as conjectural in the OEIS entry for A080578. The binary-side counting function is identified with a shifted Conolly sequence. We then develop the parent map, truncation blocks, truncation remainders, and the Mersenne tau function associated with this representation. The parent map is conjugate to deletion of the lowest digit. Differences of the Mersenne tau rows recover the parent iterates and the counting function, and they give formulas for digit reconstruction and for a diagonal tau defect. Finally, we revisit a known finite-depth one-soliton family of the finite-field BBS. The Mersenne combinatorics is used directly to reconstruct a global integer-valued traveling-wave profile and to prove an integer window-counting theorem. Reduction modulo 3 yields the corresponding finite-field traveling-wave solutions. We also construct an integer-valued traveling-wave tau function whose front values are given by the Mersenne tau rows. The resulting construction shows how the combinatorics of a number representation can enter directly into the reconstruction of solutions of an integrable system.

Figures

Figures reproduced from arXiv: 2607.22202 by the authors.

Figure 1
Figure 1. A numerical evolution of the finite-field BBS variable [PITH_FULL_IMAGE:figures/full_fig_p003_1.png] view at source ↗
Figure 2
Figure 2. The traveling-wave tau function and its forward Ω-difference at depth [PITH_FULL_IMAGE:figures/full_fig_p033_2.png] view at source ↗

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

9 extracted references · 4 canonical work pages

  1. [1]

    Solitons with a nested structure over finite fields,

    F. Yura, “Solitons with a nested structure over finite fields,”Journal of Physics A: Math- ematical and Theoretical, 47 (2014), 325201. doi:10.1088/1751-8113/47/32/325201

    work page doi:10.1088/1751-8113/47/32/325201 2014

  2. [2]

    Meta-Fibonacci sequences,

    B. W. Conolly, “Meta-Fibonacci sequences,” in S. Vajda,Fibonacci & Lucas Numbers, and the Golden Section: Theory and Applications, Ellis Horwood, Chichester; Halsted Press, New York, 1989, pp. 127–138

    1989

  3. [3]

    Meta-Fibonacci sequences, binary trees and extremal com- pact codes,

    B. Jackson and F. Ruskey, “Meta-Fibonacci sequences, binary trees and extremal com- pact codes,”Electronic Journal of Combinatorics, 13 (2006), no. 1, Research Paper R26. doi:10.37236/1052

    work page doi:10.37236/1052 2006

  4. [4]

    Nested recurrence relations with Conolly-like solutions,

    A. Erickson, A. Isgur, B. W. Jackson, F. Ruskey, and S. M. Tanny, “Nested recurrence relations with Conolly-like solutions,”SIAM Journal on Discrete Mathematics, 26 (2012), no. 1, 206–238. doi:10.1137/100795425

    work page doi:10.1137/100795425 2012

  5. [5]

    On Cloitre’s hiccup sequences,

    R. Fokkink and G. Joshi, “On Cloitre’s hiccup sequences,”The Ramanujan Journal, 69 (2) (2026), Article 40. doi:10.1007/s11139-025-01305-1

    work page doi:10.1007/s11139-025-01305-1 2026

  6. [6]

    G. H. Hardy and E. M. Wright,An Introduction to the Theory of Numbers, 6th ed., revised by D. R. Heath-Brown and J. H. Silverman, Oxford University Press, 2008

    2008

  7. [7]

    From soliton equations to integrable cellular automata through a limiting procedure,

    T. Tokihiro, D. Takahashi, J. Matsukidaira, and J. Satsuma, “From soliton equations to integrable cellular automata through a limiting procedure,”Physical Review Letters, 76 (1996), no. 18, 3247–3250. doi:10.1103/PhysRevLett.76.3247

    doi:10.1103/physrevlett.76.3247 1996

  8. [8]

    org, accessed July 20, 2026

    The OEIS Foundation Inc., entries A001511, A004128, A005187, A011371, A046699, A055938, and A079559,The On-Line Encyclopedia of Integer Sequences,https://oeis. org, accessed July 20, 2026

    2026

Show all 9 references
  1. [9]

    A080578,

    The OEIS Foundation Inc., “A080578,”The On-Line Encyclopedia of Integer Sequences, https://oeis.org/A080578, accessed July 20, 2026. 34

    2026

Pith tools

Reviewed August 1, 2026 · model on record in the stance chip above.