Home · Search the collection · Verification · Lean status
Each entry links to the mathematical argument and its accompanying checks. The claims below retain the scope stated in the notes; formalization status is tracked separately.
Partial results on open problems
- Frankl’s conjecture (partial). Generators supported in four consecutive positions of a common cyclic order guarantee an abundant point. For uniform generators with every point in three generators and incidence girth at least 16, each point occurs in at least 51.8208% of the unions. Local proof · Frequency proof · Replay Both all-point frequency bounds are fully Lean-verified; the cyclic span-four formalization remains incomplete. Checked scope.
- Lonely Runner (partial). Two arbitrary positive integer speeds can be added to any Goddyn–Wong simultaneous acceleration. The proof gives a prescribed interval for the common witness and an obstruction to the corresponding three-speed assertion. Proof · Replay The complete insertion note is Lean-verified, including the unbounded speeds, acceleration criterion, common-dilation value bound, and literal three-insertion obstruction. Checked scope.
- Erdős–Gyárfás (partial). Every abelian cover of with one edge subdivided has a cycle of length 4, 8, 16 or 32. A 19-sheeted cyclic example attains the upper bound. The universal voltage-cover theorem, literal 95-vertex sharpness example, and normalization of all seven voltages are Lean-verified. Lean scope. Proof · Replay
- Hadamard existence conjecture, order 2396 (open). The signed automorphism group of any candidate matrix has order coprime to 479. The fixed-border common multiplier group is cyclic of order dividing four, with at least 151 sign orbits. Lean verifies these statements, both norm-obstruction proofs, the complete conditional fixed-border construction from its original four sign rows, all fourteen size-149 baseline patterns, and the length-598 order-eleven obstruction. Lean also constructs the actual Hadamard matrix from any Legendre pair and proves the invariant quotient transport from the original centered rows. The order and orbit theorems for odd automorphism subgroups on groups of order nine are also checked. For length-1197 Legendre pairs, Lean proves that the common-multiplier order divides 27; the stated sharper bound of nine and the exhaustive quotient/no-lift certificates remain pending. No order-2396 matrix existence is claimed. Checked scope and receipts · Automorphism proof · Sequence proof · Reproduce.
Solitaire and combinatorial games
| Result | Finding | Lean | Evidence |
|---|---|---|---|
| Generalized Bulgarian solitaire limit shapes | Eriksson–Jonsson–Sjoestrand (2020), Conj. 1: fixed-scale counterexample (a_n = 1) and corrected theorem for arbitrary layer sets at every diverging scale. |
☑ | Lean · Proof |
| Pham's Bulgarian solitaire denominator degree | Pham (2022), §6: primitive period-10 necklace with reduced denominator degree 5. | ☑ | Proof · Check |
| Spivey's three-player War | Spivey (2010), Q5: three winner-first conventions admit cycles with all three players active. | ☑ | Proof · Check |
| CUT Family B: nim-sequence threshold | Ellis–Thanatipanonda (2022), Conj. 2: nim-sequence matches the base game iff the least odd cut above 1 exceeds three times the least even cut. | ☑ | Proof · Check |
| CUT arithmetic periodicity with a preperiod | Dailly et al., Open Problem 4: finite arithmetic-periodicity test; both examples have preperiod 6, period 12, saltus 8. | ☑ | Proof · Check |
Graph theory and discrete geometry
| Result | Finding | Lean | Evidence |
|---|---|---|---|
| Graffiti.pc Conjecture 318 | DeLaViña (2007): every total dominating set contains a dominating pair under the given even-distance bound. Credited to @JesterInABarrel. | ☑ | Proof · Check · Lean |
| Li's chromatic symmetric function signs | Li (2026), Problems 4.9 and 4.6 (first question): 31-vertex non-spider tree with [e_3e_2^14]X_T = +29. |
☐ | Proof · Check |
| Erdős Problem 607: line-size sets | Sharp counting asymptotic for records of actual finite real-plane configurations, with the exact leading prefactor. Lean verifies the geometric count, formal and analytic generating functions, Fourier extraction, all limit and domination inputs, and the final stated asymptotic. | Complete | Proof · Formalization and receipts · Finite check |
| Distance graphs with three missing differences | Carraher et al., arXiv Conjecture 38 proved for all admissible parameters. Conjecture 39 fails for every k=50,59,68,…. The corrected formula gives all densities for gaps five and seven. |
☑ | Strip verifier and counterexample verifier |
Number theory, packing and partitions
| Result | Finding | Lean | Evidence |
|---|---|---|---|
| Batista's Egyptian fractions | OEIS A398581: the lexicographically first triple uniquely maximizes the last denominator for admissible k ≢ 1 (mod 5). |
☑ | Proof · Check |
| Rectangle partition asymptotics | Gajdzica–Zakarczemny, Remark 5.9: uniform asymptotic for log p(h,w) as h → ∞, w ≥ h. |
☑ | Proof · Check |
| Two-difference Motzkin density | The exact character formula for every pair in every compact abelian group, including noncyclic finite subgroups. Lean verifies the exhaustive relation-basis classification, compact and cyclic formulas, exact evaluator with explicit complexity bounds, and literal attaining witnesses. The cyclic maximum-independent-set problem has a prior 2026 solution. | Complete | Proof · Formalization · Finite checks |
| Liu–Zhu packing and Natalchenko–Sagdeev covering | Sharp densities for every symmetric four-point set of integers. For odd coprime steps the proof determines the longest interval that can be covered exactly once. | ☑ | Proof and finite checks |
| Natalchenko–Sagdeev nonmixed-gap packing | Natalchenko–Sagdeev’s main packing conjecture for arbitrary gap counts. The same formula gives the circle parameter in their Section 4 question. | ☑ | Proof and finite checks |
| Haralambis’s three-difference conjecture | For every triple of positive integer differences, the extremal density equals the circle rotation bound. One pair sum is a period of an optimal set. | ☑ | Proof and certificate checks |
Lonely runners
| Result | Finding | Lean | Evidence |
|---|---|---|---|
| Loneliness on a fixed relation hyperplane | Explicit conditional limiting law for all admissible normals and shifts, with a uniform fixed-tolerance tail. | Complete | Proof · Exact checks |
| Five-speed Loneliness Spectrum Conjecture | The values below 1/5 are exactly s/(5s+1) for positive integers s. Cordella’s twelve sporadic primitive quintuples exhaust the exceptions to the two known families. Lean verifies the lower bound 1/6 and both primitive tight-five directions; the full spectrum classification remains incomplete. | Partial | Proof · Tight-five proof and receipt · Exhaustive verifier |
| Eight-speed Loneliness Spectrum Conjecture | The values below 1/8 are exactly s/(8s+1). Three infinite families and 17 sporadic tuples exhaust the primitive cases. | ◐ | Proof and exhaustive verifier |
| Seven-speed Amended Loneliness Spectrum Conjecture | The values below 1/7 are exactly s/(7s+1), 3/23, 5/37 and 9/65. One infinite family and 27 sporadic tuples exhaust the primitive cases. Lean supplies the proved five-speed bound in the critical-plane and large-norm implications; PrimitiveSixClassification remains an explicit premise. |
◐ | Proof and exhaustive verifier |
| Six-speed Loneliness Spectrum Conjecture | The values below 1/6 are exactly (P−1)/(6P) for P ≥ 7 congruent to ±1 modulo 6. Cordella’s nine sporadic sextuples exhaust the exceptions to the three known families. Lean verifies realization of every proposed value by six distinct positive primitive speeds; actual rational-lattice, Gram and integer-factor components are proved, and the registered norm wrappers use the proved four-speed bound and retain hplane. Universal classification remains incomplete. Lean also proves the conditional two-parameter radius estimate; the finite plane enumeration remains incomplete. |
Partial | Proof · Realization proof and receipt · Exhaustive verifier |
| Tight six-speed sets and seven-coordinate critical subtori | The consecutive set is the unique primitive six-speed equality case. The seven-coordinate critical plane is unique up to signs and permutations. | ◐ | Proof and exhaustive verifier |
| Eight lonely runners, all equality cases | Exactly three primitive seven-speed sets attain 1/8. They are the consecutive speeds and the two examples in Goddyn and Wong’s census. | ◐ | Proof and exhaustive verifier |
| Nine lonely runners, unique equality case | The consecutive speeds 1 through 8 are the only primitive set attaining 1/9. | ◐ | Proof and exhaustive verifier |
| Eleven through fourteen lonely runners, all equality cases | Only consecutive primitive speeds attain equality for 11–13 runners. For 14 runners the Goddyn–Wong set is the only further case. | Partial; conditional norm reduction checked | Proof and verifier |
| Ten lonely runners, unique equality case | The consecutive speeds 1 through 9 are the only primitive set attaining 1/10. | Partial; conditional norm reduction checked | Proof and exhaustive verifier |
☑ Lean formalization of the stated result · ◐ Partial formalization with explicit remaining dependencies · ☐ No Lean formalization
See docs/lean-status.md for exact formalized statements and gaps.
Precise scope
The L-solitaire counterexample relies on the original paper's Definitions 2--4 allowing positive, not necessarily diverging, horizontal scaling factors. It does not refute the natural corrected assertion for diverging scales. The note supplies a proof of that corrected assertion for all admissible layer sets.
The necklace result refutes only Pham's exact-degree guess. It does not refute the distinct Harris--Nguyen (2025) conjecture that a necklace and its reverse-complement dual admit a common denominator of degree equal to their period. The included dual calculation is consistent with that conjecture.
The Li example is neither a spider nor a caterpillar and refutes the non-spider sign prediction. Earlier spider constructions already refute the unrestricted coefficient assertion; likewise, earlier literature contains trees with two degree-4 vertices. The newly reported result is explicitly limited to the non-spider class, and novelty is provisional pending independent review (see the novelty audit). This example does not refute Dahlberg--She--van Willigenburg's general non-e-positivity conjecture.
These are mathematical claims with explicit proofs and computer checks, not peer-reviewed publications. A literature search cannot establish that a counterexample or stronger theorem is the first discovery. Please cite the primary publications when discussing the original conjectures.
Primary sources
Matthias Beck and Samuel Everett, Lonely Runner Relations, §4, ask for the statistical behavior on one prescribed relation hyperplane.
Ermelinda DeLaViña, Written on the Wall II, Graffiti.pc Conjecture 318, announced March 4, 2007; catalogue updated November 5, 2026. Proof shared by @JesterInABarrel on November 18, 2026; an externally contributed result, not authored by this repository's maintainer.
Kimmo Eriksson, Markus Jonsson, Jonas Sjoestrand, Limit shapes of stable and recurrent configurations of a generalized Bulgarian solitaire, Online Journal of Analytic Combinatorics 15 (2020), paper 10. Definitions 2--4, Theorems 3--5, Conjecture 1.
Nhung Pham, Limiting behavior in growth of Bulgarian solitaire orbits (2022), Theorem 1.2 and section 6.
A. J. Harris and Son Nguyen, Bulgarian Solitaire: A new representation for depth generating functions, Australasian Journal of Combinatorics 93 (2025), Conjecture 1.1.
Brian Hopkins, Henrik Eriksson's Bulgarian Solitaire Variant, INTEGERS 24A (2024), Theorem 5 (cyclic states for consecutive bottom-layer picking).
Ethan Y. H. Li, A quantitative way to e-positivity of trees, arXiv:2503.09484v2 (10 February 2026), Section 4, Problems 4.6 and 4.9.
Kai Zheng, On the e-positivity of trees and spiders, Journal of Combinatorial Theory, Series A 189 (2022), Theorem 5.3 (earlier spider coefficient formula).
Mirko Hornak and Mariusz Wozniak, On arbitrarily vertex decomposable trees, 2006 preprint / Discrete Mathematics 308 (2008), 1268--1281 (older spider and two-degree-four-vertex cases).
Davion Q. B. Tang, David G. L. Wang and Monica M. Y. Wang, e-Positive caterpillars have maximum degree at most three, arXiv:2610.39481v1 (29 October 2026) (caterpillar case).
David Batista, OEIS A398581, and Hùng Việt Chu, Theorem 1.3 on best two-term underapproximations.
Václav Kotesovec’s conjectured exponential base for the counting function in Erdős Problem 607. The verifier accepts the 10,000-term reference table with the option
--table b401948.txt.
For the other entries, primary publications and conjecture identifiers are cited in their linked proof notes.