Solved conjectures

Proofs, counterexamples, and partial results in combinatorics and number theory, with reproducible checks and Lean 4 formalizations.

72 research entries · 32 stated results formalized in Lean · 19 partial formalizations · 21 not formalized

Pfaffian matching bounds

Johnson's conjecture

Complete proposed proof of Conjecture 7.1 for every positive nonincreasing log-convex distance kernel, every even order, and every perfect matching. A stronger theorem for products of circular interval factors follows from a complement scaling and adjacent-pair deletion. Johnson's endpoint theorem and kernel uncrossing reduction are credited.
Lean: partial formalization
Subtree roots

Brown–Mol's conjecture

Complete proposed disproof of the universal translated-annulus assertion. An infinite family of diameter-four trees has subtree roots strictly inside the forbidden disk, proved by a local analytic zero argument. A separate exact Rouché certificate verifies a 1001-vertex example. The outer inequality remains separate.
Lean: formalized stated result
Matrix Hardy norms

Kovalev's conjecture

Complete proposed disproof of Conjecture 6.1. A uniform positive diagonal matrix family violates the lower Hardy-duality comparison in every order at least 500001. The supporting functional has dual norm exactly one; analytic Gaussian bounds give a strict rational separation. The separate upper inequality is not resolved.
Lean: not formalized
Radial kernels in BCS theory

Roos–Seiringer's conjecture

Complete proposed proof that the radial Dirichlet kernel is strictly positive at every positive argument, with the zero endpoint and all positive chemical potentials covered. Analytic tails and an essential exact integer interval certificate prove the full scalar assertion. The unaveraged kernel is separate.
Lean: not formalized
Intrinsic-volume sequence realizability

Dospolova–Germanskov–Zaporozhets's conjecture

Complete proposed disproof of the ultra-log-concave sequence realizability conjecture. Every positive factorial sequence c^k/k! satisfies the conjectured inequalities with equality but cannot be an intrinsic-volume sequence. A strict global-range/local-oscillation comparison and Vitale's published limit theorem provide the obstruction. Long's earlier results also permit a short alternative deduction and are explicitly credited. Three independent mathematical reviews passed.
Lean: partial formalization
Macdonald polynomial semirings

Chen–Khare–Sahi's conjecture

Complete proposed disproof of the majorization-to-Muirhead-semiring implication in Conjecture 5. A rational functional is nonnegative on an exhaustive generating list of 38 products and seven monomials, but strictly negative on an admissible normalized Macdonald difference. Exact eigenoperator and independent Hall-inner-product constructions identify the polynomials. Rectangular translates and a continuous parameter family give further counterexamples to the same assertion. Ordinary evaluation positivity is not refuted.
Lean: partial formalization
Beta-prime self-convolution

Ferreira–Simon's conjecture

Complete proposed analytic proof of the independent beta-prime self-convolution identity for every positive first shape and every second shape strictly between zero and one half. A quadratic hypergeometric transformation evaluates the mixing factor; a beta integral identifies the Mellin transforms on a nonempty strip. Two independent derivations passed.
Lean: not formalized
Gamma medians

Lyon's conjecture

Complete proposed computer-assisted proof that the transformed unit-scale gamma median decreases strictly for every positive real shape. Analytic arguments handle both unbounded tails. Exact integer interval arithmetic certifies all 4258 median brackets and 4256 cells covering the remaining compact interval; convexity makes each inequality valid throughout its cell. The certificate is essential, and two complete independent replays passed.
Lean: not formalized
Lyapunov matrix optimization

Han–Sabag–Kostina–Hassibi's conjecture

Complete proposed disproof of the Lyapunov positivity conjecture. A rational feasible encoder has power strictly below the infimum over every encoder with one nonzero per column. All sparse assignments are exhausted, and the same failure holds on an open interval of channel gains. The full matrix assertion is refuted; no separate communication-code theorem is claimed.
Lean: formalized stated result
Zeros of Gaussian shift sums

Gröchenig's problem

Complete proposed disproof of the universal upper-density comparison in Problem 4.12. One nonzero Gaussian shift sum with absolutely summable real coefficients has coefficient sign-change upper density one half and zero-set upper density at least one. An infinite block construction preserves sign witnesses at arbitrarily large scales. The separate lower-density assertion remains undecided here.
Lean: not formalized
Gauss–Legendre quadrature

López Pouso–Segura's node conjecture

Complete proposed disproof of the exact upper inequalities in published Conjectures 3 and 7. An exact common witness refutes both; a positive fourth-order correction proves failure of Conjecture 3 for every sufficiently large even degree. The leading asymptotic constant and separate Bessel-limit results are unaffected. Independent internal mathematical review passed.
Lean: partial formalization
Zeros of polynomial transforms

Vishnyakova's conjecture

Complete proposed proof of the full root-radius conjecture, including all positive weights. Every zero lies in a sharper centered disk; the outer radius is attained. A complex-parameter exclusion and Grace–Walsh–Szegő polarization extend the credited earlier equal-parameter result to arbitrary independent parameters. Two internal mathematical reviews passed.
Lean: formalized stated result
Polynomial identities and positivity

Novelli–Thibon's conjecture

Complete proposed proof of the intended monomial-product Conjecture 5.7 for all partitions and independent parameters. A universal first-derivative identity and the Pieri rule prove the product formula; a plethystic evaluation also gives every hook coefficient. The source index typo is corrected explicitly. Two internal mathematical reviews passed.
Lean: not formalized
Bessel zeros and weights

López Pouso–Segura's conjectures

Complete proposed proofs of published Conjectures 2, 5, and 8: positivity or negativity, strict monotonicity, and exact limits of all three Bessel-weight sequences. Inverse-phase convexity gives the signs; a Fourier–Bessel resolvent determines the limits. The linked assertions count as one result. Two independent internal reviews passed.
Lean: partial formalization
Graph theory and discrete geometry

Németh–Seberry–Shu conjecture

The number of distinct permanent values of prime-order binary circulants grows superlinearly, contrary to the 1979 conjecture. A refinement gives a quadratic lower bound.
Lean: not formalized
Graph theory and discrete geometry

Sonntag–Teichert conjecture

The minimal dominating sets of every tournament form a connected hypergraph after deleting isolated vertices. For oriented graphs with missing arcs, the only disconnected supports are two disjoint stars.
Lean: formalized stated result
Graph theory and discrete geometry

Horňák–Woźniak conjecture

Admissibility suffices for every tripod and, with the induced tripod admissible, for every four-arm tree with a one-edge arm. Three of the five arithmetic tests suffice.
Lean: partial formalization
Lonely runners

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.
Lean: partial formalization
Partition statistics

McCrea's conjecture

Complete proposed proof of the unique linear-density crossover for the two fixed-perimeter Franklin statistics, for every modulus at least three and every permitted density. Positive power-series factorizations give local coefficient asymptotics including the floor; opposite monotonicity of the two growth exponents gives existence and uniqueness. Independently reviewed internally.
Lean: not formalized
Mittag–Leffler functions and stochastic ordering

Simon's stable-infimum conjecture

Complete proposed proof that the mean-normalized fixed-time infima of spectrally negative stable processes increase in convex order throughout the full source parameter interval, including the Brownian endpoint. Increasing logarithmic Lévy measures yield an independent mean-one multiplier.
Lean: not formalized
Mittag–Leffler functions and stochastic ordering

Ferreira–Simon's stochastic-order conjecture

Complete proposed proof of the usual stochastic decrease of the normalized inverse-stable family throughout the full real parameter interval. One Poisson coupling is almost surely strictly decreasing for every parameter pair. The endpoint limits and Mittag–Leffler bounds follow from the same argument.
Lean: not formalized
Mittag–Leffler functions and stochastic ordering

Ferreira–Simon's diagonal Mittag–Leffler conjecture

Complete proposed proof that the diagonal Mittag–Leffler value at minus one strictly increases throughout the unit parameter interval. A classical sine quantile, logarithmic contraction and reciprocal pairing give a bounded pointwise integral comparison. The endpoint and crossing-point consequences are not counted separately.
Lean: not formalized
Polynomial identities and positivity

Ferreira–Simon's Wright log-concavity conjecture

The full threshold-to-log-concavity implication is false. Lean proves a continuous boundary family directly from the infinite Wright series and a strict midpoint violation. The written proof also gives interior positive-parameter families.
Lean: formalized stated result
Polynomial identities and positivity

Alexandersson's Fuss–Catalan conjecture

A short classical deduction proves real-rootedness for all parameters: changing the Fuss parameter only multiplies the known ordinary-Dyck polynomial by a positive scalar. Prior-resolution audit qualified.
Lean: formalized stated result
Polynomial identities and positivity

Chen–Kitaev–Zhang's record conjectures

Complete proposed proofs of the original Conjectures 1 and 3 for every permitted length. New one-, two- and three-record comparisons combine with the credited earlier Conjecture 2 tail theorem. Independent internal review passed; no separate count is assigned to individual statistics.
Lean: formalized stated result
Polynomial identities and positivity

Zhu's generalized Jacobi–Stirling conjecture

Complete disproof of the unweighted coefficientwise Hankel-total-positivity conjecture. The leading three-by-three determinant has coefficient minus four at a squared times x to the fourth power. A symbolic identity also supplies an open region of strictly positive real counterexamples. Independent internal review passed.
Lean: formalized stated result
Polynomial identities and positivity

Sagan–Swanson conjecture

Conjecture 7.8 is proved: all four q-Stirling coefficient distributions are asymptotically normal whenever k/nk/n tends to any value in (0,1)(0,1), using their actual means and variances.
Lean: not formalized
Polynomial identities and positivity

Bernardi–Morales's delta-process conjecture

Published Conjectures 27–28 are proved for all admissible parameters. The tree count holds for every fixed color map, and the stronger event identity holds for every fixed surjection.
Lean: formalized stated result
Polynomial identities and positivity

Gilmore's crossing–nesting conjecture

Conjecture 6.16 is proved for every row: the product-defined matrix's first column enumerates perfect matchings by crossings and nestings. Its additional parameter counts aligned pairs.
Lean: formalized stated result
Number theory, packing and partitions

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.
Lean: formalized stated result
Lonely runners

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.
Lean: partial formalization
Lonely runners

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.
Lean: partial formalization
Graph theory and discrete geometry

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.
Lean: formalized stated result
Graph theory and discrete geometry

Johnson–Kaya–Matzke conjecture on Babai spectra of paths

Johnson–Kaya–Matzke, arXiv Conjecture 2.1: for all 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.
Lean: formalized stated result
Polynomial identities and positivity

Chow's conjecture

Ordinary type-D Eulerian polynomials interlace in consecutive ranks, strictly from rank three onward. The weak assertion is a direct deduction from Savage–Visontai's published refinement theorem; the note supplies an additional strictness argument.
Lean: formalized stated result
Graph theory and discrete geometry

Circulants with circular chromatic index in the upper half

Mazák–Zrubák, arXiv:2603.08822, Section 8: no graph with Δ>=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.
Lean: partial formalization
Graph theory and discrete geometry

Li's chromatic symmetric function signs

31-vertex non-spider, non-caterpillar tree: [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.
Lean: formalized stated result
Solitaire and combinatorial games

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.
Lean: formalized stated result
Graph theory and discrete geometry

Mazák–Zrubák conjecture on complete graphs minus an edge

Mazák–Zrubák, arXiv Conjecture 2: for every even 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.
Lean: not formalized
Number theory, packing and partitions

Batista's Egyptian fractions

OEIS A398581: the lexicographically first triple uniquely maximizes the last denominator for admissible k ≢ 1 (mod 5).
Lean: formalized stated result
Polynomial identities and positivity

Baricz–Pogány's asymptotic-coefficient positivity conjecture

Previously published result package: every asymptotic coefficient of degree at least two exceeds the stated geometric term for every permitted real Bessel order. A formal-series factorization supplies a strict positive lower bound. The source audit records an inaccessible submitted follow-up and does not assert exclusive priority.
Lean: formalized stated result
Permanental compounds

Perron root of permanental compounds

A general FPRAS for every nonnegative rational input and every compound degree, with deterministic zero detection. This answers the randomized approximation formulation of Minc Problem 18; exact polynomial-time eigenvalue computation and the characteristic-polynomial problem are not claimed. The proof is unrefereed and priority remains provisional.
Lean: not formalized
Permanent minima

Pula–Song–Wanless conjecture

Complete proposed proof of the cohesive/noncohesive threshold for every block size, including equality, with a unique boundary minimizer at and above the threshold. The new threshold proof repairs the old equalization argument; previously known directions are credited. This is a named subsidiary conjecture, not the full characterization requested by Minc Problems 14 or 15.
Lean: not formalized
Combinatorics on words

Currie's conjecture on complexity 2n+1 and critical exponent

Currie, Electron. J. Combin. 33(3) #P3.31, Conjecture 19 (arXiv Conjecture 1): each of the ten listed morphic images of the fixed point 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.
Lean: not formalized
Subpermanent transform inequalities

Malek's conjecture

Complete proposed proof of the negative-transform comparison for every order and every subpermanent degree, with all equality cases. A stronger reciprocal-mean capacity estimate closes every proper degree; the full-permanent endpoint is prior work. This is a named subsidiary in the Minc site's linked survey, not a new numbered Conjecture 3 resolution. Two internal reviews found no gap; priority remains provisional.
Lean: not formalized
CombinatoricsPartial result on an open problem

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.

Lean: partial formalization
Lonely runnersPartial result on an open problem

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.

Lean: formalized stated result
Partial results on open problemsPartial result on an open problem

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.

Lean: not formalized
Graph theory and discrete geometryPartial result on an open problem

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.

Lean: formalized stated result
CombinatoricsPartial result on an open problem

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 · .

Lean: partial formalization