Solved conjectures
Proofs, counterexamples, and partial results in combinatorics and number theory, with reproducible checks and Lean 4 formalizations.
29 results
Full catalogue and sourcesLoneliness on a fixed relation hyperplane
Eight-speed Loneliness Spectrum Conjecture
Seven-speed Amended Loneliness Spectrum Conjecture
Six-speed Loneliness Spectrum Conjecture
hplane. Universal classification remains incomplete. Lean also proves the conditional two-parameter radius estimate; the finite plane enumeration remains incomplete.
Eleven through fourteen lonely runners, all equality cases
Ten lonely runners, unique equality case
Nine lonely runners, unique equality case
Eight lonely runners, all equality cases
Five-speed Loneliness Spectrum Conjecture
Liu–Zhu packing and Natalchenko–Sagdeev covering
Natalchenko–Sagdeev nonmixed-gap packing
Two-difference Motzkin density
Tight six-speed sets and seven-coordinate critical subtori
Distance graphs with three missing differences
k=50,59,68,…. The corrected formula gives all densities for gaps five and seven.
Rectangle partition asymptotics
log p(h,w) as h → ∞, w ≥ h.
CUT Family B: nim-sequence threshold
Erdős Problem 607: line-size sets
CUT arithmetic periodicity with a preperiod
Generalized Bulgarian solitaire limit shapes
a_n = 1) and corrected theorem for arbitrary layer sets at every diverging scale.
Graffiti.pc Conjecture 318
Li's chromatic symmetric function signs
[e_3e_2^14]X_T = +29.
Pham's Bulgarian solitaire denominator degree
Spivey's three-player War
Batista's Egyptian fractions
k ≢ 1 (mod 5).
Frankl’s union-closed sets conjecture — two classes of generating families
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. · · Both all-point frequency bounds are fully Lean-verified; the cyclic span-four formalization remains incomplete. Checked scope.
Lonely Runner — inserting two speeds into tight families
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. · 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 — a sharp bound for abelian covers of a subdivided tetrahedron
Erdős–Gyárfás (partial). Every abelian cover of K_4 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.
Hadamard order 2396 — partial results
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 · · Sequence proof · .
No matching results
Try a shorter search or clear the filters.