Sign-alternation conjecture for the flat Bernoulli game coefficients
Let be the coefficient of in , so that for ,
The first entries are positive, while is negative and the subsequent entries appear to have alternating signs. Sign-alternation conjecture. For ,
Equivalently, holds for . This is the conjectured continuation of the observed alternation in the coefficient sequence associated with the flat Bernoulli game; the supplied text gives no resolution of the conjecture.
References
2 papers in this index state this conjecture (2002–2009). The statement above is taken from the most recent of them; the others are arXiv:math/0202304.
Source: Gábor Hetyei, “Enumeration by kernel positions for strongly Bernoulli type truncation games on words”, arXiv:0912.0573 (2009).
Progress summary
A reader-submitted argument claims to prove the predicted sign pattern from the twelfth coefficient onward, but the claim has not been independently verified.
The conjecture asks whether the coefficients eventually alternate in sign, equivalently whether for . Catalogued papers from 2002–2009 record the conjecture but report no resolution.
Community submission (unverified), October 28, 2026
A submitted proof argues that the adjacent-count inequality holds for every , using a renewal-sequence sign argument, matrix inequalities, and finite checks. Its mathematical correctness has not been independently assessed.
Current status (as of October 2026): The conjecture remains open in the verified record; a community submission claims a proof for all , but that claim is unverified.
Solutions 1
We prove the adjacent-count inequality in Hetyei Conjecture 6.10 for every n>=12. After factorial normalization, a renewal sequence has negative increments from index 11 onward. Symmetric arrowhead matrices, weighted power inequalities and exact finite checks propagate the sign. The literal ordered-composition factorial count and every spectral, recurrence and limit bridge are proved in Lean.See full solution
We prove the adjacent-count inequality in Hetyei Conjecture 6.10 for every n>=12. After factorial normalization, a renewal sequence has negative increments from index 11 onward. Symmetric arrowhead matrices, weighted power inequalities and exact finite checks propagate the sign. The literal ordered-composition factorial count and every spectral, recurrence and limit bridge are proved in Lean. The source sign typo, helpers and finite checks do not count as separate results.
AI-assisted preprint by Myeongjin Kang, with no affiliation. Internal AI review is not external journal peer review. The accompanying Lean certificate covers the precise scoped main statement; inspect the formal endpoint, assumptions and provenance in the supporting package. Prior-art investigations are documented bounded searches, not worldwide-priority certification. Original prose is offered under CC BY 4.0 and original code/Lean under MIT; third-party rights and existing notices are preserved. The public supporting ZIP contains original proof sources and verification evidence, with bibliographic links and hashes instead of redistributed third-party source manuscripts.
Recorded prior-art/source-access limits: Final JCTA/Sterling body and comprehensive worldwide coverage remain unavailable; bounded independent screen found no known resolution. No worldwide-priority claim.
Full paper: All-order adjacent-count inequality for the flat Bernoulli game.
Lean proof sources and pinned verification evidence: Zenodo supporting package. MathDB has not automatically verified the attached Lean certificate.