Solved conjectures
Proofs, counterexamples, and partial results in combinatorics and number theory, with reproducible checks and Lean 4 formalizations.
72 results
Full catalogue and sourcesKauers–Koutschan recurrence conjecture
Johnson's conjecture
Brown–Mol's conjecture
Kovalev's conjecture
Roos–Seiringer's conjecture
Dospolova–Germanskov–Zaporozhets's conjecture
Chen–Khare–Sahi's conjecture
Ferreira–Simon's conjecture
Lyon's conjecture
Han–Sabag–Kostina–Hassibi's conjecture
Gröchenig's problem
López Pouso–Segura's node conjecture
Vishnyakova's conjecture
Novelli–Thibon's conjecture
López Pouso–Segura's conjectures
Haralambis’s three-difference conjecture
Németh–Seberry–Shu conjecture
Natalchenko–Sagdeev nonmixed-gap packing
Liu–Zhu packing and Natalchenko–Sagdeev covering
Sonntag–Teichert conjecture
Horňák–Woźniak conjecture
Eight-speed Loneliness Spectrum Conjecture
Seven-speed Amended Loneliness Spectrum Conjecture
PrimitiveSixClassification remains an explicit premise.
McCrea's conjecture
Simon's stable-infimum conjecture
Ferreira–Simon's stochastic-order conjecture
Ferreira–Simon's diagonal Mittag–Leffler conjecture
Ferreira–Simon's Wright log-concavity conjecture
Karp–Vishnyakova–Zhang's gamma-quotient conjecture
Alexandersson's Fuss–Catalan conjecture
Chen–Kitaev–Zhang's record conjectures
Zhu's generalized Jacobi–Stirling conjecture
Sagan–Swanson conjecture
Bernardi–Morales's delta-process conjecture
Gilmore's crossing–nesting conjecture
Two-difference Motzkin density
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.
Five-speed Loneliness Spectrum Conjecture
Erdős Problem 607: line-size sets
Loneliness on a fixed relation hyperplane
Distance graphs with three missing differences
k=50,59,68,…. The corrected formula gives all densities for gaps five and seven.
Oravcová–Soták conjecture for five to eight distances
k in {5,6,7,8}, the chromatic number is k+1 exactly for {1,...,k-1,ks}, {1,2,3,5,8}, {1,4,5,6,7} and {1,2,3,4,5,7,12}. The classification is conditional on the repository's five- to eight-speed spectrum results. Contributed by @aadrianvv.
Johnson–Kaya–Matzke conjecture on Babai spectra of paths
n>=2 and 1<=k<=n-1, the chromatic numbers of the k-element distance graphs of the path P_n are exactly the integers from ceil(n/(n-k)) to k+1. The missing lower bound comes from the bound n-k on independent sets.
Chow's conjecture
Rectangle partition asymptotics
log p(h,w) as h → ∞, w ≥ h.
Circulants with circular chromatic index in the upper half
Δ>=8 and circular chromatic index in (Δ+1/2, Δ+1) was known. For every g>=2 the circulant C_{6g+1}(1,...,2g-2, 2g+1, 3g) is 4g-regular and 4g-connected with χ'_c = 4g+2/3, and C_25(1,2,3,7,...,12) is 18-regular and 18-connected with χ'_c = 75/4. This answers the non-trivial reading of their Problem 6 for d ≡ 0 mod 4, d>=8, and for d=18; Problem 7 is not answered. Computer-certified further examples include C_31(1,2,3,7,...,12) with χ'_c = 93/5 and non-regular graphs with Δ ≡ 1, 2 mod 4, 25<=Δ<=54. One independent model referee pass.
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₂¹⁴e₃]X_T=29, [e₂⁸e₃⁵]X_T=−6304, all 6,842 partition types, exactly eight partitions of type (3,2^14), and 2^30 connected vertex partitions in total.
CUT Family B: nim-sequence threshold
Mazák–Zrubák conjecture on complete graphs minus an edge
d>=6, the circular chromatic index of K_{d+1} minus one edge is d+1. By Guichard's theorem a smaller value would give a proper (d+1)-edge-colouring with acyclic digraph of consecutive colours, and the proof excludes such colourings. One independent model referee pass; the scripts check d=4 and d=6.
Eleven through fourteen lonely runners, all equality cases
Zhang's Question 8.4: deletion values of the lonely runner
n >= 3, 1 <= r <= n-1, and V = [n-1] \ {r}, LR(V) = 1/r when 2r > n-1, and LR(V) = 2/D_r when 2r <= n-1, where D_r is the least integer at least n+r coprime to r. In particular the strict inequality holds for all n >= 4 and 1 <= r <= n-2. Contributed by @aadrianvv.
Ten lonely runners, unique equality case
Nine lonely runners, unique equality case
Eight lonely runners, all equality cases
Tight six-speed sets and seven-coordinate critical subtori
CUT arithmetic periodicity with a preperiod
Batista's Egyptian fractions
k ≢ 1 (mod 5).
Pham's Bulgarian solitaire denominator degree
Spivey's three-player War
Baricz–Pogány's asymptotic-coefficient positivity conjecture
Perron root of permanental compounds
Pula–Song–Wanless conjecture
Currie's conjecture on complexity 2n+1 and critical exponent
G of [01,2,02] or of its reversal has factor complexity 2n+1 and critical exponent exactly μ = 2+1/(λ²-1), where λ is the real root of x³-2x²+x-1; the supremum is not attained. The proof reduces the words to three languages, describes all their bispecial factors and proves the final inequalities by exact arithmetic in Q(λ). One independent model referee pass.
Malek's conjecture
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–Granville–Pomerance–Spiro conjecture
Erdős–Granville–Pomerance–Spiro conjecture. The preimage of every natural density-zero set under the sum-of-proper-divisors map has density zero within a fixed input family of natural density about 53.46%. The arguments use three second-moment estimates for different prime-factor ranges. Scope and proofs · Finite checks.
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.