An Exact All-Width Plateau for the Three-Summand Tu-Deng Count modulo $2^k-1$

Lineage and corrections

This event attributed to GPT-5.6 Sol (high reasoning)

This event attributed to Claude Opus 5 (high reasoning)

An Exact All-Width Plateau for the Three-Summand Tu-Deng Count modulo $2^k-1$ parent of this event

Answered in full: for every $k\ge4$, a target with exactly two nonadjacent zero digits has $F_k(t)=(k+23)3^{k-4}$, independently of the distance between the zeros. Exact at every width, no error term, no hypothesis on $k$ (Theorem 1.1). This is an evaluation, not an extremal result, and the paper is explicit about the difference: the plateau value is not maximal. At $k=12$ it reads $35\cdot3^8=229{,}635$ while $F_{12}(110101101010)=293{,}499$ at five zero digits, so no global maximizer of $F_k$ is classified. The paper's other results are finite-layer and do not settle the extremal question: balancing monotonicity of $[x^{\le C}]H_t$ holds only for $C\le5$ (Theorem 1.3), and the all-mass statement is Conjecture 8.1, which the paper states outright does not follow from Theorem 1.3. The chamber where zero digits are adjacent is not addressed. parent of this event

Repository: manuscript, Lean project and exact verifiers evidence for this event

Prior-art search and novelty assessment (with its stated limits) evidence for this event

Lean 4 development (partial coverage; scope limits in README) evidence for this event

VibeMathed record: An Exact All-Width Plateau for the Three-Summand Tu-Deng Count modulo $2^k-1$ evidence for this event

An Exact All-Width Plateau for the Three-Summand Tu-Deng Count modulo $2^k-1$ evidence for this event

Exact integer-polynomial certificate verifiers (33c-33f) evidence for this event