| WOWII #2 | LeanProofGraph Theory | Neighbourhood independence and leaves in spanning trees | Submitted an independent Lean 4 proof on 2026-07-27; Formal Conjectures records its maximum-edge triangle-free-spanning-subgraph argument as the third formal proof, and PR #4654 was approved and merged on 2026-08-08 | 2026-07-27 | OPEN2026-07-27 |
| WOWII #31 | LeanProofLiteratureGraph Theory | Induced-path length versus graph radius | Formalized the published Erdős–Saks–Sós / Fan Chung proof of p(G) ≥ 2·rad(G) − 1 in Lean 4 and submitted the proof link in PR #4658 | 2026-07-28 | SOLVED2026-07-28 |
| WOWII #217 | LeanProofGraph Theory | Leaf number, graph residue, and Hamiltonian paths | Submitted a complete Lean 4 proof that the WOWII #217 leaf-number and residue bound forces a Hamiltonian path; PR #4656 was reviewer-approved and merged on 2026-08-04 | 2026-07-28 | OPEN2026-07-28 |
| WOWII #316 | LeanProofGraph Theory | Pendant vertices and well total domination | Submitted a complete Lean 4 proof of WOWII Graph Conjecture 316 to Formal Conjectures on 2026-07-13; the contribution was accepted by a Formal Conjectures reviewer, and PR #4426 was merged on 2026-08-07 | 2026-07-13 | OPEN2026-07-13 |
Lonely Runner variant Tao (2017) asymptotic lower bound | LeanStatementLiterature | Improved asymptotic lower bound for the gap of loneliness | Added the Lean definitions of the gap of loneliness and the formal statement of Tao's 2017 asymptotic lower bound; PR #2177 was approved and merged on 2026-05-06 | 2026-02-06 | SOLVED2026-02-06 |
| OQP #40 | Quantum InformationLiteratureStatus | Refinement of the Bessis–Moussa–Villani conjecture | Literature note: Cha–Lee counterexamples disprove the proposed upper bound; the violation ratio can be arbitrarily large | 2026-07-13 | OPEN2026-07-13 |
MathOverflow #507128 R = Q(R) · proper invertible ideal I ⊊ R | LeanProofCounterexample | Explicit cuspidal-cubic idealization counterexample | Constructed and formally verified an explicit R = Q(R) with a proper invertible ideal; the MathOverflow asker validated the Lean4Web proof, and PR #4644 was reviewer-approved and merged on 2026-08-04 | 2026-07-27 | OPEN2026-07-27 |
Bézier–Bernstein Voronovskaja formula α > 0, α ≠ 1 · f ∈ C²[0,1] | LeanProof | Central-limit-scale asymptotics of Bézier-type Bernstein operators | Determined and Lean-formalized the exact √n-limit μ(α)√(x(1−x))f′(x) for α > 0, α ≠ 1 and f ∈ C²[0,1], and submitted the complete Lean 4 proof in PR #4646 | 2026-07-27 | OPEN2026-07-27 |
Convex additive VC₂ dimension convex C ⊆ ℝ³ proposed upper bound 1 | LeanProofCounterexample | Six-halfspace counterexample to the proposed upper bound | Constructed and Lean-verified a convex polyhedron in ℝ³, defined by six halfspaces, that disproves the proposed additive VC₂-dimension upper bound 1 in PR #4657 | 2026-07-28 | OPEN2026-07-28 |
Monochromatic Quantum Graph even N ≥ 6 · D ≥ 3 ℤ and {-1,0,1}-valued weights | LeanProofQuantum InformationGraph Theory | Nonexistence for all even integer-weight cases | Submitted a solver-free Lean 4 proof of nonexistence for every even N ≥ 6 and D ≥ 3 over ℤ, settling six integer and six trinary-integer declarations in PR #4659 | 2026-07-29 | OPEN2026-07-29 |
Monochromatic Quantum Graph even N ≥ 6 · D ≤ N − 2 commutative integral domains | LeanProofQuantum InformationGraph Theory | Sharp upper bound on the number of colors | Submitted a solver-free Lean 4 proof of the sharp bound D ≤ N − 2 over every commutative integral domain, settling three Formal Conjectures high-color cases in PR #4661 | 2026-07-29 | OPEN2026-07-29 |
Monochromatic Quantum Graph N=6, D=4 over ℂ | LeanProofQuantum InformationGraph Theory | Nonexistence of a monochromatic quantum graph equation-system solution | Submitted a complete Lean 4 proof that the N=6, D=4 monochromatic quantum graph equation system has no solution over ℂ; the proof works over every commutative integral domain | 2026-07-30 | OPEN2026-07-30 |
| Weak Tiling 4.3 | LeanProofCounterexample | Weak tiling measures versus convex combinations of proper tilings | Found an explicit counterexample to the statement formalized as Weak Tiling Problem 4.3 and submitted a kernel-checked Lean 4 proof in PR #4704 | 2026-08-04 | OPEN2026-08-04 |
Erdős #42 constructive Sidon-set variant | LeanProofAdditive Combinatorics | Threshold function for Sidon sets with disjoint difference sets | Submitted a complete Lean 4 proof of the constructive Erdős #42 variant; reviewer mo271 approved it and PR #4853 was merged on 2026-08-10, marking the variant solved | 2026-08-10 | OPEN2026-08-10 |
Moving Sofa uniqueness unrestricted-set misformalization | Misformalization Detection | Gerver-sofa uniqueness stated over every planar set | Identified that the Moving Sofa uniqueness theorem quantified over every planar set; the counterexample was credited in reviewer-approved PR #4852, which corrected the statement to uniqueness of moving sofas up to rigid motion and was merged on 2026-08-10 | 2026-08-10 | OPEN2026-08-10 |
Green Problem 14 AKS14 lower-bound status correction | LiteratureStatusCorrection | Established lower bounds W(3,t) for 20 ≤ t ≤ 39 | Identified that 20 AKS14 lower-bound declarations for 20 ≤ t ≤ 39 were established by finite certificates rather than open conjectures, and proposed marking them research solved | 2026-08-10 | OPEN2026-08-10 |
Erdős #973 negative-answer status correction | LiteratureStatusCorrection | Exterior power sums and nonexistence of an exponential constant | Identified Luo–Yang–Zhu's negative solution of Erdős #973, documented the exact asymptotic obstruction, and proposed changing the Formal Conjectures entry to research solved with answer(False) | 2026-08-10 | OPEN2026-08-10 |
Square Packing negative-radius least-element flaw | Misformalization Detection | Nonexistence of least feasible radii when radii range over all reals | Showed that allowing r ∈ ℝ makes two circle-container least-radius statements false: every feasible radius has a smaller feasible radius; proposed restricting r ≥ 0 or using ℝ≥0 | 2026-08-10 | OPEN2026-08-10 |
Erdős #80 infeasible c=2 misformalization | Misformalization Detection | Book-size asymptotics quantified beyond the feasible edge-density range | Detected that both Erdős #80 declarations quantify over every c>0: at c=2 no simple n-vertex graph can have 2n² edges, so f(2,n)=0 and both formal statements are false | 2026-08-11 | OPEN2026-08-11 |
Fernandes Conjecture 1 2-generation of Γ(m ⊕ n) | LeanProofGroup Theory | Two-generation of equal-sign permutation-pair subgroups | Submitted a complete Lean 4 proof that Γ(m ⊕ n) is 2-generated outside the four stated exception pairs, using explicit generators, Goursat kernels, and alternating-group containment | 2026-08-11 | OPEN2026-08-11 |
Erdős #608 known counterexample status report | LiteratureStatusGraph Theory | Edges contained in 5-cycles above the Mantel threshold | Reported that Erdős #608 was already disproved by the Füredi–Maleki construction documented in 2016, and linked primateria’s complete external Lean 4 disproof | 2026-08-11 | SOLVED2026-08-11 |
Erdős #539 three exponent variants | LeanProofAdditive Combinatorics | Growth exponent of the cofactor-set threshold | Proved that the zero-inclusive Formal Conjectures threshold has logarithmic exponent 1/2, refuting both proposed n^(2/3) growth variants; reviewer-approved and merged into Formal Conjectures on 2026-08-15 | 2026-08-11 | OPEN2026-08-11 |
MathOverflow #10799 Kahn–Kalai Conjecture 7 | LeanProofCounterexample | Critical-probability optimality of monotone Boolean families | Independently formalized the Diskin–Kreitner scale-dense dual-tribes counterexample, disproving the fixed-1000 Formal Conjectures variant and the original Conjecture 7 form; reviewer-approved and merged into Formal Conjectures on 2026-08-15 | 2026-08-11 | OPEN2026-08-11 |
Microscopic Weighting ten-point metric counterexample | LeanProofCounterexampleMetric Geometry | Microscopic weighting versus finite concentration | Constructed and Lean-verified a ten-point metric space with finite concentration but no microscopic weighting, disproving Roff–Willerton Conjecture 3.3 | 2026-08-11 | OPEN2026-08-11 |
Green Problem 52 logarithmic variant | LeanProofLiteratureCounterexampleAdditive Combinatorics | Affine subspaces in double sumsets over Boolean cubes | Formalized the Hamming-ball counterexample credited to Kaave Hosseini and Ryan Alweiss in Lean 4; reviewer-approved PR #4887 was merged, closing FC's O(log K) variant while the qualitative O_K(1) question remains open | 2026-08-12 | OPEN2026-08-12 |
Erdős #692 Part II maximum-existence variant | LeanProofNumber Theory | Density of integers with exactly one divisor in an interval | Proved that δ₁(n,m) attains a maximum over m > n+1 for every fixed n, by reducing the search to an explicit finite interval | 2026-08-12 | OPEN2026-08-12 |
Erdős #319 underformalized Big-O target | Misformalization DetectionLeanProofNumber Theory | The “simplest upper bound” reduced to an arbitrary upper bound | Detected that the FC target does not encode “simplest” or optimal: the ambient-set bound c(N)≤N closes it without using the signed reciprocal-sum condition | 2026-08-12 | OPEN2026-08-12 |
Erdős #357 √n lower Big-O variant | LeanProofNumber Theory | Distinct consecutive interval sums in increasing integer sequences | Constructed an admissible sequence of length ⌊√n⌋ and proved its consecutive interval sums distinct, yielding the explicit FC answer √n = O(f(n)) | 2026-08-13 | OPEN2026-08-13 |
Erdős #357 three additional lower-growth targets | LeanProofNumber Theory | Lower growth and strict-versus-weak monotonicity for distinct interval sums | Proved log n = o(f(n)), √n = O(h(n)), and log n = o(h(n)) by combining the strict √n lower bound with a formal proof that the weak and strict extremal functions agree | 2026-08-15 | OPEN2026-08-15 |
Erdős #688 constant-answer upper-bound flaw | Misformalization DetectionLeanProofNumber Theory | Asymptotic decay of the extremal covering exponent | Detected that the FC upper-bound target admits g(n)=1: a Lean witness proves 0≤ε_n≤1 without estimating decay, so filling the answer hole would not solve Erdős #688 | 2026-08-13 | OPEN2026-08-13 |
Erdős #142 trivial linear upper-bound flaw | Misformalization DetectionLeanProofNumber Theory | Upper estimates for progression-free subsets of {1,…,N} | Detected that the FC upper-bound target admits g(N)=N: the ambient cardinality bound r_k(N)≤N closes it without proving a nontrivial estimate or asymptotic formula | 2026-08-13 | OPEN2026-08-13 |
OEIS A237271 square and hexagonal parity | LeanProofLiteratureNumber Theory | Parity of the number of parts in symmetric divisor-sum representations | Proved both square and hexagonal parity targets with one complementary-divisor involution, formalizing the existing OEIS middle-divisor parity characterization in Lean 4; mo271 approved the PR on its first review | 2026-08-13 | OPEN2026-08-13 |
OEIS A287616 known-solution status | LiteratureStatusCorrectionNumber Theory | Universal sum of triangular, pentagonal, and heptagonal numbers | Reported that Cao–Guo–Qiu–Feng–Gao prove the exact A287616 representation theorem, and proposed changing the Formal Conjectures declaration to research solved | 2026-08-13 | OPEN2026-08-13 |
Green Problem 3 known-solution status | LiteratureStatusCorrectionAdditive Combinatorics | Product-free open subsets of the unit interval | Reported Franchi–Gowers–Yip's affirmative solution of Green Problem 3 and proposed changing the Formal Conjectures answer to True with research-solved status | 2026-08-13 | OPEN2026-08-13 |
Green Problem 31 two upper-bound status corrections | LiteratureStatusCorrectionAdditive Combinatorics | Improved upper bound for finite Sidon sets | Reported Hou–Zhao's bound F(N)≤√N+0.9435N^(1/4)+O(1), which improves 0.98183 and settles both the infinitely-often and eventual Formal Conjectures upper-bound targets | 2026-08-13 | OPEN2026-08-13 |
Open Quantum Problem 35 AME(7,6) and AME(7,10) | LiteratureStatusCorrectionQuantum Information | Existence of seven-party absolutely maximally entangled states | Reported Shi–Zhang–Zhao–Li's existence theorem for every AME(7,d) with d≥3, giving answer(True) for the open d=6 and d=10 benchmark declarations | 2026-08-13 | OPEN2026-08-13 |
Open Quantum Problem 35 AME(12,5) known-solution status | LiteratureStatusCorrectionQuantum Information | Existence of an absolutely maximally entangled state on twelve ququints | Reported Bevins–Bidav's explicit AME(12,5) construction and proposed setting the Formal Conjectures benchmark to answer(True) with research-solved status | 2026-08-13 | OPEN2026-08-13 |
Independent Domination even and odd bound status | LiteratureStatusCorrectionGraph Theory | Independent domination number for bounded-degree graphs | Reported that Cho–Kim–Kim–Oum's Corollary 1.3 proves both displayed independent-domination bounds and proposed marking the even and odd Formal Conjectures declarations solved | 2026-08-13 | OPEN2026-08-13 |
MathOverflow #31809 counterexample status | LiteratureStatusCorrectionCategory Theory | Pre-triangulated categories that are not triangulated | Reported Chen–Liu–Lu–Zhang's explicit pre-triangulated non-triangulated category, giving answer(False) to the Formal Conjectures version of MathOverflow #31809 | 2026-08-13 | OPEN2026-08-13 |
Green Problem 19 internally implied bound status | LiteratureStatusCorrectionAdditive Combinatorics | Corner-density exponent lower and upper bounds | Detected that the solved theorem C=4 already in the same file implies both open bounds C≥3.13 and C≤4, and proposed marking the redundant declarations solved | 2026-08-13 | OPEN2026-08-13 |
Erdős #272 main-asymptotic status | LiteratureStatusCorrectionAdditive Combinatorics | Maximum size of families with arithmetic-progression intersections | Detected that the recorded Szabó estimate N²/2+O(N^(5/3)log³N) already yields the open main asymptotic N²/2, and proposed marking the principal declaration solved | 2026-08-13 | OPEN2026-08-13 |
Green Problem 37 sublinear upper bound m(N,k)=o(N) | LeanProofAdditive Combinatorics | Sparse sets containing a k-term progression of every difference up to N | Constructed a Fermat-number CRT periodic cover and proved in Lean 4 that m(N,k)=o(N) for every fixed k; the Big-O target follows from the same explicit answer N↦N | 2026-08-14 | OPEN2026-08-14 |
Erdős #361 asymptotic growth Θ(n) | LeanProofAdditive CombinatoricsNumber Theory | Largest subset of [1,⌊cn⌋] avoiding n as a subset sum | Proved in Lean 4 that the maximum subset-sum-avoiding cardinality has order Θ(n) for every fixed c>0, using an explicit interval-block lower-bound construction | 2026-08-14 | OPEN2026-08-14 |
Poisson n-Lie Conjecture 3.5 scalar-matrix determinant bracket | LeanProofNonassociative AlgebraStatement | Determinant brackets from scalar matrices and commuting derivations | Proved the exact general target proposed in PR #4893, first establishing the same Poisson n-Lie identities for arbitrary natural n and m without the registered lower bounds | 2026-08-14 | OPEN2026-08-14 |
OEIS A113019 third fixed point 9⁹ | LeanProofCounterexampleNumber Theory | Fixed points of the digit-length–digital-root power map | Found and Lean-verified the third fixed point 387420489 = 9⁹, disproving the proposed classification of 1 and 32 as the only fixed points; OEIS approved and published the result | 2026-08-15 | OPEN2026-08-15 |
OEIS A100478 eventual periodicity | LeanProofNumber Theory | Prime-counting Pentanacci recurrence from arbitrary initial data | Proved that every orbit of the prime-counting Pentanacci recurrence from arbitrary nonnegative initial data is bounded and therefore eventually periodic | 2026-08-15 | OPEN2026-08-15 |
OEIS A108306 general INVERT–matrix identity | LeanProofNumber Theory | INVERT transforms and powers of a 2×2 matrix | Proved the full OEIS A108306 conjecture for arbitrary natural parameters by realizing the INVERT convolution as a two-state matrix recurrence | 2026-08-15 | OPEN2026-08-15 |
OEIS A105801 eventual constancy modulo 3ᵏ | LeanProofNumber Theory | 3-adic stabilization of the Fibonacci–Collatz sequence | Proved that the Fibonacci–Collatz sequence is eventually constant modulo 3ᵏ for every positive k, resolving the full registered OEIS conjecture | 2026-08-15 | OPEN2026-08-15 |
OEIS A112970 three dyadic-ray identities | LeanProofNumber Theory | Dyadic rays in a generalized Stern sequence | Proved all three OPEN A112970 targets from the stronger dyadic-ray identity a(c·2ⁿ−1)=a(c−1), using only the sequence's odd recurrence | 2026-08-15 | OPEN2026-08-15 |
OEIS A113250 odd-indexed terms are squares | LeanProofNumber Theory | Square terms in the m=4 specialization of a fourth-order recurrence family | Proved every odd-indexed term of A113250 is a square by specializing the parameterized identity A₂ₙ₊₁=Yₙ² at m=4 | 2026-08-15 | OPEN2026-08-15 |
OEIS A113252 odd-indexed terms are squares | LeanProofNumber Theory | Square terms in the m=6 specialization of a fourth-order recurrence family | Proved every odd-indexed term of A113252 is a square by specializing the parameterized identity A₂ₙ₊₁=Yₙ² at m=6 | 2026-08-15 | OPEN2026-08-15 |
OEIS A113255 odd-indexed terms are squares | LeanProofNumber Theory | Square terms in the m=9 specialization of a fourth-order recurrence family | Proved every odd-indexed term of A113255 is a square by specializing the parameterized identity A₂ₙ₊₁=Yₙ² at m=9 | 2026-08-15 | OPEN2026-08-15 |
OEIS A103425 prime-free weighted Tribonacci witness | LeanProofNumber Theory | Prime-free third-order linear recurrences | Answered the exact OPEN target with the relatively prime coefficients (1,1,−1) and the constant prime-free sequence xₙ=4 | 2026-08-15 | OPEN2026-08-15 |
OEIS A114831 asymptotic ratio √3 | LeanProofOEISNumber Theory | Asymptotics of a harmonic-mean recurrence | Proved a(n+1)/a(n) → √3 by expressing the ratio recurrence as a vanishingly perturbed contraction with fixed point √3 | 2026-08-15 | OPEN2026-08-15 |
OEIS A102371 A105033 complement identity | LeanProofOEISNumber Theory | Sloping binary numbers, bitwise carries, and XOR recurrence | Proved a(n)=2ⁿ−1−A105033(n−1) for every n≥1 through a bitwise carry recurrence and a fixed-width XOR complement identity | 2026-08-15 | OPEN2026-08-15 |
OEIS A102722 a(n) ~ (1−γ)n | LeanProofOEISNumber Theory | Fractional-part sums and the Dirichlet divisor problem | Proved a(n) ~ (1−γ)n by formalizing Dirichlet's hyperbola method, controlling floor errors, and deriving the normalized limit | 2026-08-15 | OPEN2026-08-15 |
OEIS A112521 recursive-array main diagonal | LeanProofOEISCombinatorics | NOR bracketings, recursive arrays, and WZ telescoping | Proved a(n)=T(n,n) for all n≥1 using transformed Fibonacci polynomials, a WZ recurrence, and positivity of the resulting signed binomial sum | 2026-08-15 | OPEN2026-08-15 |
OEIS A211417 four divisibility targets | LeanProofOEISNumber Theory | Factorial ratios, p-adic valuations, and Landau step functions | Proved three atomic divisibility conjectures for the factorial ratio a(n), then derived the fourth product divisibility target by controlling pairwise gcds | 2026-08-16 | OPEN2026-08-16 |
Lₚ Rogers–Shephard Conjecture 5 equality rigidity | LeanProofConvex Geometry | Equality rigidity for planar centrally symmetric convex bodies | Proved that equality in the planar Lₚ Rogers–Shephard bound forces the convex body to be a parallelogram with a vertex at the origin | 2026-08-16 | OPEN2026-08-16 |
OEIS A105751 2-adic valuation asymptotic | LeanProofOEISNumber Theory | Gaussian-integer products and exact 2-adic valuations | Proved ν₂(a(n)) ~ n/4 via exact formulas in all four residue classes, obtained from a dyadic block induction for the Gaussian-integer product | 2026-08-16 | OPEN2026-08-16 |
OEIS A100474 first semiprime after a(11) | LeanProofComputationOEISNumber Theory | Certified recurrence evaluation, minimality, and large-prime proof | Determined a(36) as the first semiprime after a(11), excluded every index 12–35, and certified its 131-digit prime cofactor in Lean | 2026-08-16 | OPEN2026-08-16 |
Erdős #979 k=3 prime-cube representations | LeanProofNumber Theory | Unbounded representation counts for sums of three prime cubes | Independently proved that sums of three prime cubes have unbounded representation multiplicity, using the CM theory of the Fermat cubic and Hecke-coefficient asymptotics | 2026-08-17 | SOLVED2026-08-17 |
Convex VCₙ bound false n=0 case | Misformalization DetectionLeanProofCounterexampleConvex Geometry | Finite additive VCₙ dimension of convex sets in ℝⁿ⁺¹ | Showed in Lean that the universal convex VCₙ-bound declaration is false at n=0: translates of the singleton {0}⊆ℝ realize every pattern, defeating every finite d | 2026-08-18 | OPEN2026-08-18 |
OEIS A129365 four valuation conjectures | LeanProofOEISNumber Theory | GCD-product ratios and an exact p-adic valuation formula | Proved all four conjectures from one exact valuation identity, establishing integrality, prime support, block invariance, and the A004125 valuation sum | 2026-08-18 | OPEN2026-08-18 |
OEIS A003625 quadratic irreducibility over GF(p) | LeanProofLiteratureOEISNumber Theory | Quadratic reciprocity and irreducibility over GF(p) | Formalized the classical criterion p mod 7∈{3,5,6} iff x²+x+2 is irreducible over GF(p), using completion of the square and quadratic reciprocity | 2026-08-19 | OPEN2026-08-19 |
Erdős #394 reversed lower-bound direction | Misformalization DetectionNumber Theory | Growth of the Erdős–Hall divisor-product function t₂(n) | Detected that the two sides of ≫ are swapped: the declaration labeled as the known lower bound instead states an upper bound strong enough to collapse the open Hall conjecture | 2026-08-19 | SOLVED2026-08-19 |
OEIS A078590 integrality counterexample at n=7 | LeanProofCounterexampleOEISNumber Theory | Integrality of a nonlinear exponential recurrence | Disproved integrality at the first failing step n=7: the numerator is 9 modulo 171, so the resulting rational term has reduced denominator 19 | 2026-08-21 | OPEN2026-08-21 |
OEIS A070823 squarefree-cofactor counterexample at n=20 | LeanProofCounterexampleOEISNumber Theory | Decimal-concatenation recurrence and squarefree cofactors | Proved the divisibility-by-3 half for every n>2, but disproved the squarefree-cofactor claim at n=20 by exhibiting the unavoidable square factor 13² | 2026-08-21 | OPEN2026-08-21 |
OEIS A159829 Conjecture 1 odd-exponent prime-value obstruction | LeanProofCounterexampleOEISNumber Theory | Prime values of sums of two like powers | Disproved the all-k infinitude claim at k=3 and proved the stronger classification that for every odd k≥3 the only prime representable as nᵏ+mᵏ is 2 | 2026-08-21 | OPEN2026-08-21 |
OEIS A185895 Conjecture 3 prime-power Gauss congruences | LeanProofOEISCombinatoricsNumber Theory | Gauss congruences for signed distinct-block partition counts | Proved the full prime-power Gauss congruences by rewriting the coefficients as signed multinomial sums and reducing them coefficientwise modulo pᵏ | 2026-08-21 | OPEN2026-08-21 |
OEIS A022030 alternating nonlinear recurrence | LeanProofOEISNumber Theory | Linear recurrence forced by an alternating nonlinear rounding process | Proved the recurrence for the alternating sequence 4,16,63,249,… by identifying a linear candidate and bounding its alternating determinant defect | 2026-08-21 | OPEN2026-08-21 |
OEIS A049473 ζ(3) tail and Beatty difference classification | LeanProofOEISNumber Theory | ζ(3) approximation and complementary Beatty sequences | Proved both the ζ(3) tail bracketing and the exact A001954/A001953 classification of the zero and one steps of the nearest-integer sequence | 2026-08-21 | OPEN2026-08-21 |
OEIS A076141 binary sub-pattern uniqueness in n² | LeanProofOEISCombinatoricsNumber Theory | Binary words occurring in the square n² | Proved that the binary word of n occurs at most once in the binary word of n², including overlapping occurrences | 2026-08-21 | OPEN2026-08-21 |
Erdős #367 false ∀ε higher-full-parts variant | Misformalization DetectionLeanProofCounterexampleNumber Theory | Limsup growth of products of r-full parts | Disproved the universal-ε variant at (r,k,ε)=(3,2,2): divisibility Bᵣ(m)∣m bounds the normalized product by 2, so its limsup is finite | 2026-08-22 | OPEN2026-08-22 |
Melnikov valency-variety 37-vertex counterexample | LeanProofCounterexampleGraph Theory | Chromatic number versus the number of distinct vertex degrees | Constructed a 37-vertex tripartite graph with w(G)=30 and χ(G)=3; the proposed lower bound is also 3, so the required strict inequality fails by equality | 2026-08-22 | OPEN2026-08-22 |
Green Problem 29 approximate-group subset bound is false | LeanProofLiteratureCounterexampleAdditive CombinatoricsGroup Theory | Large subsets of approximate groups with controlled product sets | Adapted the certified public slab counterexample to FC: a 3-approximate group in Multiplicative ℤ×H forces every S⊆A with S⁸⊆A⁴ to have cardinality at most 1 | 2026-08-22 | OPEN2026-08-22 |
Erdős #539 two square-root variants are false | LeanProofCounterexampleAdditive CombinatoricsNumber Theory | Growth of the cofactor-set threshold beyond every constant multiple of √n | Proved in Lean 4 that h(n)/√n tends to infinity, so h(n) is neither O(√n) nor Θ(√n); the exact growth of h remains open | 2026-09-05 | OPEN2026-09-05 |
Erdős #354(ii) common base γ=√φ | LeanProofAdditive CombinatoricsNumber Theory | Completeness of floor-power sequences for a common exponential base | Proved that γ=√((1+√5)/2) works for every α>0; the α-sequence alone is complete, so β and the irrational-ratio assumption are unnecessary | 2026-09-05 | OPEN2026-09-05 |
Erdős #879(ii) optimal-set factor bound | LeanProofNumber Theory | Prime-factor structure of maximum-weight pairwise-coprime subsets | Proved the stronger universal bound ω(a)≤2 for all members of every sufficiently large optimal admissible set, so the proposed unbounded-prime-factor claim already fails at k=3 | 2026-09-06 | OPEN2026-09-06 |
Bugeaud Problem 10.5 lacunary fractional parts | LeanProofNumber Theory | Universal lacunary sequences over real number fields | Built a single positive lacunary integer sequence whose fractional parts have a cluster point in every ε-interval for every ξ∉K, proving both registered targets | 2026-09-20 | OPEN2026-09-20 |
Convex additive VCₙ finite bound for n≥1 | LeanProofConvex Geometry | Finite additive VCₙ dimension of convex sets in ℝⁿ⁺¹ | Proved VCₙ(C)≤2^(8(n+2)^n)−1 for every n≥1 and convex C⊆ℝⁿ⁺¹; the sharper bounds 2 and 3 remain open | 2026-09-20 | OPEN2026-09-20 |
Erdős #1095 upper-conjecture status | LiteratureStatusCorrectionNumber Theory | Upper bound for the Ecklund–Erdős–Selfridge function g(k) | Reported that Ecklund–Erdős–Selfridge (1974) already prove g(k) < exp(k(1+o(1))), the coefficient-1 exponential bound, and proposed marking the declaration solved | 2026-09-21 | OPEN2026-09-21 |
Erdős #160 better upper and lower bounds | LiteratureStatusCorrectionAdditive Combinatorics | Colourings in which every four-term progression receives three colours | Reported Shi–Dong's improved upper bound and the stronger lower bound implied by Bloom–Sisask, and proposed marking both better-bound declarations solved | 2026-09-21 | OPEN2026-09-21 |
TxGraffiti Conjecture 2 counterexample status | LiteratureStatusCorrectionGraph Theory | Zero forcing versus independence in subcubic graphs | Reported Fischer's connected 24-vertex counterexample of maximum degree 3, which falsifies Z(G) ≤ α(G)+1 and gives answer False | 2026-09-21 | OPEN2026-09-21 |
Erdős #968 increasing and decreasing triples | LiteratureStatusCorrectionAnalytic Number Theory | Monotone triples in the normalized primes pₙ/n | Reported that Ford–Maynard–Tao's chains of large prime gaps and Maynard's bounded prime clusters give infinitely many increasing and decreasing triples, answering both True | 2026-09-21 | OPEN2026-09-21 |
Cyclic-subgroup solvability Conjecture 5.5 status | LiteratureStatusCorrectionGroup Theory | Solvability from the number of cyclic subgroups | Reported that Theorem 7.1 of the revised Das–Dey–Galindo–Sharma paper proves the cyclic-subgroup solvability threshold cyc(G) < 2^(t+2), and proposed marking it solved | 2026-09-21 | OPEN2026-09-21 |
Bugeaud 10.4 uncountable-spectrum counterexample | LiteratureStatusCorrectionNumber Theory | Spectrum of the geometric sequence ξαⁿ modulo one | Reported Özcan's result that the spectrum of (ξαⁿ) can be uncountable, a stronger counterexample for every α > 1, giving answer False | 2026-09-21 | OPEN2026-09-21 |
Erdős #1099 factorial and LCM variants | LiteratureStatusCorrectionNumber Theory | Bounded divisor-ratio sums along n! and lcm(1,…,n) | Reported that Theorem 1 of Tenenbaum (1987) bounds h_α(n!) and h_α(lcm(1,…,n)) for every α > 1, and proposed marking both variants solved | 2026-09-21 | OPEN2026-09-21 |
Erdős #331 Ruzsa variant status | LiteratureStatusCorrectionAdditive Combinatorics | Common differences of sets with square-root asymptotic density | Reported that Theorem 4 of Erdős–Freud (1984) proves Ruzsa's asymptotic-density variant, and proposed marking the declaration solved | 2026-09-21 | OPEN2026-09-21 |
Erdős #906 known-solution status | LiteratureStatusCorrectionComplex Analysis | Dense zeros of high derivatives of an entire function | Reported that Hou's preprint Cofinite Zeros of High Derivatives proves the existence statement of Erdős 906, and proposed marking it solved | 2026-09-21 | OPEN2026-09-21 |
Kourovka 19.25 counterexample status | LiteratureStatusCorrectionGroup Theory | Simplicity from group order and totient sums of element orders | Reported that the order-6048 counterexample of van Doorn–Judin–Monticone–Morrison applies to the current Kourovka 19.25 declaration, giving answer False | 2026-09-21 | OPEN2026-09-21 |
Kourovka 20.76 counterexample status | LiteratureStatusCorrectionGroup Theory | Abelian subgroups of p-groups with small abelian normal subgroups | Reported Muliarchyk's Proposition 6.1, a 2-group of order 2¹⁴⁵ whose abelian normal subgroups have order at most 2⁴² but which has an abelian subgroup of order 2⁸⁵, giving answer False | 2026-09-21 | OPEN2026-09-21 |
Green Problem 44 counterexample status | LiteratureStatusCorrectionAnalytic Number Theory | Sieving half the residue classes modulo 1000 primes | Reported that Green Problem 44 is the same question as Erdős 1202, whose negative resolution gives a counterexample and answer False | 2026-09-21 | OPEN2026-09-21 |
Tu–Deng conjecture known-solution status | LiteratureStatusCorrectionCombinatorics | Binary weights of residue pairs modulo 2ᵏ − 1 | Reported Liu–Luo–Xie's Theorem 1.1 and Cusick's preprint as proofs of the exact Tu–Deng statement, and proposed marking the declaration solved | 2026-09-21 | OPEN2026-09-21 |
Bugeaud 10.6 two existence variants | LiteratureStatusCorrectionNumber Theory | Rapidly increasing integer sequences dense modulo one | Reported that the Ajtai–Havas–Komlós existence theorem, as recorded by Gao–Mooroogen–Yip, yields both Bugeaud 10.6 variants after integer rounding | 2026-09-21 | OPEN2026-09-21 |
Erdős #700(b) square-root exceedance status | LiteratureStatusCorrectionNumber Theory | Minimal gcd of n with its binomial coefficients | Reported a public July 24 solution combining a three-prime lemma with Maynard's theorem to give infinitely many composite n with f(n) > √n, answering part (b) True | 2026-09-21 | OPEN2026-09-21 |
Erdős #872 prime-question status | LiteratureStatusCorrectionCombinatorics | Smallest maximal primitive subsets of {2,…,n} | Reported the May 20 forum proof, supported by a 2023 paper, that every maximal primitive subset of {2,…,n} has at least π(n) elements, answering the prime question True | 2026-09-21 | OPEN2026-09-21 |
Erdős #269 rationality-variant counterexample | LiteratureStatusCorrectionNumber Theory | Reciprocal sums of partial LCMs of P-smooth numbers | Reported Steve Fan's forum proof that the sum is transcendental for two primes, a counterexample to universal rationality giving answer False | 2026-09-21 | OPEN2026-09-21 |
Erdős #1063 better-upper-bound status | LiteratureStatusCorrectionNumber Theory | Least n for which all but one of n−i divide C(n,k) | Reported a public July 25 proof of nₖ ≤ exp(o(k)), improving Cambie's k·lcm(1,…,k−1) bound, and proposed marking the declaration solved | 2026-09-21 | OPEN2026-09-21 |
Erdős #289 known-solution status | LiteratureStatusCorrectionNumber Theory | Unit fractions from separated intervals of consecutive integers | Reported the public Cambie–Land–Tang proof and Lean formalization of the separated-interval statement, and proposed marking Erdős 289 solved | 2026-09-21 | OPEN2026-09-21 |
Erdős #105 n−4 variant counterexample | LiteratureStatusCorrectionDiscrete Geometry | Lines through two points of A that avoid a disjoint set B | Reported a July 24 forum counterexample with ten points in A and six in B, refuting the n−4 variant and giving answer False | 2026-09-21 | OPEN2026-09-21 |
Erdős #263(ii) corrected-statement status | LiteratureStatusCorrectionNumber Theory | Growth of strictly increasing irrationality sequences | Reported Liam Price's May 9 forum construction as settling the corrected, strictly increasing version of Erdős 263(ii), and proposed marking it solved | 2026-09-21 | OPEN2026-09-21 |
Erdős #270 linear-variant status | LiteratureStatusCorrectionNumber Theory | Irrationality of the f(n) = n series | Reported Kovač's July 12 forum proof that Σ n!/(2n)! is irrational, settling the f(n)=n case of Erdős 270, and proposed marking the linear variant solved | 2026-09-21 | OPEN2026-09-21 |
Green Problem 47 exact-containment counterexample | LeanProofCounterexampleAnalytic Number Theory | Inverse large sieve: sparse-or-quadratic dichotomy | Constructed and Lean-verified a locally sparse set that is too large for the proposed bound yet lies in no single rational quadratic image | 2026-09-21 | OPEN2026-09-21 |
Open Quantum Problem 35 AME(11,10) existence | LeanProofQuantum Information | Absolutely maximally entangled state with eleven ten-dimensional parties | Constructed an AME(11,10) state by coupling certified binary and quinary graph-state branches, proving the exact open benchmark affirmatively | 2026-09-22 | OPEN2026-09-22 |
Green Problem 25 improved upper bound | LeanProofAdditive Combinatorics | Partition colour count versus unions of restricted sumsets | Proved that Green Problem 25 already fails at k(N)=⌈N^(23/40)⌉, improving the previous N/log N upper-bound scale | 2026-09-23 | OPEN2026-09-23 |
Open Quantum Problem 35 AME(9,6) existence | LeanProofQuantum Information | Absolutely maximally entangled state with nine six-dimensional parties | Constructed and Lean-verified an AME(9,6) state, proving that all 126 four-party reduced density matrices equal I/6⁴ | 2026-09-23 | OPEN2026-09-23 |
Square Packing three squares in a circle | LeanProofMetric Geometry | Packing three freely placed unit squares in a circle | Proved in Lean that 5√17/16 is the least circle radius for three unit squares under arbitrary placements | 2026-09-24 | OPEN2026-09-24 |
Weak Tiling 4.1 bounded support density | LeanProof | Weak tiling measures and density of their supports | Proved that the support of every weak tiling measure of a finite union of intervals has uniformly bounded point counts in unit intervals | 2026-09-24 | OPEN2026-09-24 |
Erdős #302 0.84617 upper bound | LeanProofNumber Theory | Unit-fraction triple-free sets | Submitted a Lean proof of $f(N)\le(0.8461739827964010+o(1))N$, improving the recorded $0.9N$ upper bound; the exact asymptotic remains open | 2026-09-25 | OPEN2026-09-25 |
Green Problem 41 double-exponential bound | LeanProofDynamical Systems | Double-exponential pyjama-covering bound | Submitted a Lean proof of the double-exponential pyjama-covering bound, improving the known triple-exponential bound; the exact and polynomial cases remain open | 2026-09-25 | OPEN2026-09-25 |
KLM Problem 7.2 three-dimensional convex bodies | LeanProofHarmonic AnalysisConvex Geometry | Spectral products with three-dimensional convex bodies | Proved in Lean that if A ⊂ ℝ³ is a convex body and A × B is spectral for a bounded measurable B, then B is spectral; dimensions n ≥ 4 remain open | 2026-09-25 | OPEN2026-09-25 |
Erdős #143(i) lower-density status | LiteratureStatusCorrectionNumber Theory | Density of well-separated sets of reals | Reported that Koukoulopoulos–Lamzouri–Lichtman force well-separated sets to have upper logarithmic density 0, hence lower density 0, answering part (i) True | 2026-09-25 | OPEN2026-09-25 |
Erdős #348 deletion-threshold answer | LiteratureStatusCorrectionNumber Theory | Complete sequences robust to deleting m but not n terms | Reported Geneson's theorem that such sequences exist exactly when m ≤ 1, giving the answer set {(m, n) : m < n, m ≤ 1} | 2026-09-25 | OPEN2026-09-25 |
Erdős #413(ii) ω-barrier status | LiteratureStatusCorrectionNumber Theory | Infinitely many barriers for ε·ω(n) | Reported that Lau's Theorem 1.3, giving ω(n − k) ≤ C log k for all 1 < k < n infinitely often, makes n − 1 a (1/C)·ω barrier, answering part (ii) True | 2026-09-25 | OPEN2026-09-25 |
Erdős #817 negative-answer status | LiteratureStatusCorrectionAdditive Combinatorics | Subset sums free of three-term progressions | Reported Costa's theorem liminf g₃(n)/3ⁿ = 0, which rules out 3ⁿ = O(g₃(n)) and gives answer False | 2026-09-25 | OPEN2026-09-25 |
Erdős #1046 lemniscate-diameter status | LiteratureStatusCorrectionComplex Analysis | Diameter of connected polynomial lemniscates | Reported that monic lemniscates have logarithmic capacity 1 and that cap(K) ≤ diam(K)/2, so their diameter is at least 2, answering the variant True | 2026-09-25 | OPEN2026-09-25 |
Erdős #1084 planar triangular-lattice case | LiteratureStatusCorrectionDiscrete Geometry | Planar contact numbers of triangular-lattice point sets | Reported Harborth's formula f₂(N) = ⌊3N − √(12N − 3)⌋, which at N = 3n² + 3n + 1 gives 9n² + 3n, and proposed marking the variant solved | 2026-09-25 | OPEN2026-09-25 |
Erdős #1106(i) partition-number prime factors | LiteratureStatusCorrectionNumber Theory | Distinct prime factors of products of partition numbers | Reported Schinzel–Wirsing's bound F(n) ≫ log n and Ono's theorem that every prime divides some p(n), answering part (i) True | 2026-09-25 | OPEN2026-09-25 |
Erdős #1133 robust-interpolation status | LiteratureStatusCorrectionApproximation Theory | Robust polynomial interpolation on [−1, 1] | Reported that Yang's Theorem 2.1 with ρ = 0 contains the Erdős 1133 statement, repeated nodes included, answering it True | 2026-09-25 | OPEN2026-09-25 |
Erdős #1167 finite-target case | LiteratureStatusCorrectionSet Theory | Negative stepping-up for partition relations with finite targets | Reported that Erdős–Hajnal–Máté–Rado's Combinatorial Set Theory proves the all-finite-targets case of the negative stepping-up lemma, and proposed marking it solved | 2026-09-25 | OPEN2026-09-25 |
Erdős #1207 isosceles-free subset status | LiteratureStatusCorrectionDiscrete Geometry | Large isosceles-free subsets of planar point sets | Reported that Lee–Pohoata–Zhu's point sets, in which every subset repeats some distance many times, force isosceles-free subsets of size ≲ n^(1−δ), answering True | 2026-09-25 | OPEN2026-09-25 |
Green Problem 1 sum-free subset status | LiteratureStatusCorrectionAdditive Combinatorics | Sum-free subsets beyond n/3 | Reported Bedert's theorem that every n-element set has a sum-free subset of size n/3 + c log log n, answering Green Problem 1 True | 2026-09-25 | OPEN2026-09-25 |
Green Problem 14 W(3,29) and W(3,30) values | LiteratureStatusCorrectionCombinatorics | Two-colour van der Waerden numbers W(3, r) | Reported Chowdhury–Codel–Heule's SAT bounds W(3,29) ≥ 869 and W(3,30) ≥ 904, which refute the conjectured values 868 and 903 (answer False for both) | 2026-09-25 | OPEN2026-09-25 |
Green Problem 27 improved lower bound | LiteratureStatusCorrectionAdditive Combinatorics | Smallest sets in ℤ/pℤ with no unique sums | Reported Cao–Yuan's bound m(p) ≫ log p · log log p, which beats Bedert's bound and supplies the answer function for the lower-bound declaration | 2026-09-25 | OPEN2026-09-25 |
Green Problem 35 lower bound at p = 2 | LiteratureStatusCorrectionHarmonic Analysis | Autoconvolution norms of densities on [0, 1] | Reported that ‖f∗f‖₂² ≥ 0.574575 (Martin–O'Bryant) gives c(2) ≥ 0.758 > √(4/7), supplying a lower-bound answer | 2026-09-25 | OPEN2026-09-25 |
Green Problem 35 upper bound at p = ∞ | LiteratureStatusCorrectionHarmonic Analysis | Autoconvolution norms of densities on [0, 1] | Reported that rescaling the TTT-Discover step function (autoconvolution ratio 1.50286) to [0, 1] gives c(∞) ≤ 0.75143 < 0.7516 | 2026-09-25 | OPEN2026-09-25 |
Erdős #123 snug {2,3,5}-smooth sums | LiteratureStatusCorrectionNumber Theory | Snug sums of distinct numbers of the form 2ᵏ3ˡ5ᵐ | Reported that the sorry-free Lean theorem erdos123_dcomplete_real, specialised to (2, 3, 5) with 1 < ρ < min(1 + ε, 2), gives the snug statement, answering True | 2026-09-25 | OPEN2026-09-25 |
Erdős #1054 parts (i) and (ii) | LiteratureStatusCorrectionNumber Theory | Sums of the smallest divisors of m | Reported Tao's argument with Kovač's bound #{n ≤ X : f(n) ≤ δn} ≪ δ²X, which disproves f(n) = o(n) and its almost-all version (answer False for both) | 2026-09-25 | OPEN2026-09-25 |
Erdős #1101(ii) subexponential good sequence | LiteratureStatusCorrectionNumber Theory | Good sequences with subexponential growth | Reported Peter Li's subexponential good sequence from the forum, which settles part (ii); part (i) remains open | 2026-09-25 | OPEN2026-09-25 |
Erdős #1110 coprime non-representables | LiteratureStatusCorrectionNumber Theory | Pairwise coprime integers not representable by pᵏqˡ sums | Reported that Yu–Chen (2022) handle all pairs except (5,2), (9,2), (5,3) and that a public Lean-formalized proof covers those three, answering True | 2026-09-25 | OPEN2026-09-25 |
Erdős #1212 composite visible-lattice path | LiteratureStatusCorrectionNumber Theory | Paths to infinity in the visible lattice that avoid prime pairs | Reported Alex Chengyu Li's construction of a composite-restricted path to infinity in the visible lattice, with a Lean formalization, answering True | 2026-09-25 | OPEN2026-09-25 |
TxGraffiti Conjecture 3 counterexample status | LiteratureStatusCorrectionGraph Theory | Independent domination versus saturation in regular graphs | Reported a public 48-vertex cubic graph with i(G) = 16 > μ*(G) = 15, after an earlier 50-vertex example, as counterexamples; the statement is false | 2026-09-25 | OPEN2026-09-25 |
Erdős #457 q(n, log n) variant | LiteratureStatusCorrectionNumber Theory | Least prime not dividing a product of consecutive integers | Detected that the solved erdos_457 already gives infinitely many n with q(n, log n) > (2+ε) log n, answering the variant True | 2026-09-25 | OPEN2026-09-25 |
Monochromatic Quantum Graph N = 6 consequences of D = 3 | LiteratureStatusCorrectionQuantum Information | Monochromatic quantum graph equations for N = 6 | Detected that the solved N = 6, D = 3 complex case implies the three open N = 6 declarations by restricting colours and mapping ℝ into ℂ | 2026-09-25 | OPEN2026-09-25 |
Monochromatic Quantum Graph N=10, D=8 over ℂ | LeanProofQuantum InformationGraph Theory | The equality case D = N − 2 for ten-vertex monochromatic quantum graphs | Proved in Lean that the N=10, D=8 monochromatic quantum graph system has no solution over ℂ or any integral domain, settling the equality case D = N − 2 at N = 10 | 2026-09-26 | OPEN2026-09-26 |
Erdős #522 almost-sure root count (±1 and 0/1) | LeanProofProbability | Roots of random polynomials in the closed unit disk | Proved in Lean that R_n/(n/2) → 1 almost surely for random ±1 and 0/1 polynomials; the ±1 case had earlier informal proofs, and no earlier 0/1 proof is known | 2026-09-26 | OPEN2026-09-26 |
Tensor rank mrank(3, 3, 5) = 6 | LeanProofLinear Algebra | Maximal rank of complex 3 × 3 × 5 tensors | Proved in Lean that the maximal rank of complex 3 × 3 × 5 tensors is 6, settling the one undetermined entry of the mrank(3, 3, p) table for p ≤ 9 | 2026-09-26 | OPEN2026-09-26 |
Cyclic-subgroup solvability Conjecture 5.5 Lean proof | LeanProofGroup Theory | Solvability from the number of cyclic subgroups | Formalized Conjecture 5.5 in Lean without the classification of finite simple groups, using Feit–Thompson and Gorenstein–Walter; the result itself was already proved in the paper's second version | 2026-09-26 | OPEN2026-09-26 |
Green Problem 22 N₀(r) ≤ exp exp(r⁴³) | LeanProofAdditive Combinatorics | Monochromatic x + y and xy in r-colourings of {1, …, N} | Proved in Lean that N₀(r) ≤ ⌈exp exp(r⁴³)⌉ by keeping all colours, improving Green–Sawhney's exp exp(r⁵⁰); they had noted that a slightly smaller exponent was reachable | 2026-09-27 | OPEN2026-09-27 |
Kourovka 21.149 statement and Lean proof | LeanProofStatementGroup Theory | Order automorphisms of Dlab groups and conjugation in larger Dlab groups | Formalized Kourovka 21.149 and proved in Lean that a Dlab-group order automorphism is not induced by conjugation under any injective embedding into any Dlab group, extending Gong–Yang–Zeng's rank-one, order-preserving case | 2026-09-27 | OPEN2026-09-27 |
Littlewood Problem 7 at most seven touching cylinders | LeanProofStatementDiscrete GeometryComputation | Mutually touching congruent infinite cylinders | Proved in Lean that at most seven congruent infinite cylinders touch pairwise, excluding eight lines at pairwise distance one and certifying seven exactly; the literature bound was 7 ≤ N ≤ 9 | 2026-09-30 | OPEN2026-09-30 |
Reverse Littlewood–Offord odd-n rate → 1/√2 | LeanProofStatementProbability | Random signed sums of planar unit vectors in the unit disc | Proved in Lean that F₂,₁(n)^(1/n) → 1/√2 for odd n, with a lower bound matching Hollom–Sorkin's 2^(−⌊n/2⌋) construction at the exponential scale | 2026-10-01 | OPEN2026-10-01 |
Green Problem 41 quasi-polynomial bound | LeanProofStatementDynamical Systems | Quasi-polynomial pyjama-covering bound | Proved in Lean that exp(10¹⁶(log(1/ε)+2)⁴) rotated pyjama sets cover the plane, a quasi-polynomial bound improving the earlier double-exponential one; the polynomial bound remains open | 2026-10-02 | OPEN2026-10-02 |
Ryser's conjecture 4-partite, ν ≤ 3 | LeanProofStatementCombinatoricsComputation | Covers versus matchings in 4-partite 4-uniform hypergraphs | Proved Ryser's conjecture for 4-partite hypergraphs with matching number 3 (τ ≤ 9), a case not covered by earlier results, in a computer-assisted Lean proof that also covers the known cases ν = 1, 2 | 2026-10-03 | OPEN2026-10-03 |
Quantum extremal numbers Qex(9) = 112; bounds for 10, 11 | LeanProofStatementQuantum InformationCombinatorics | Maximally mixed half-size reductions of 9-, 10- and 11-qubit pure states | Proved in Lean that Qex(9) = 112, settling the nine-qubit quantum extremal number (previously 112 ≤ Qex(9) ≤ 120), and improved the upper bounds to Qex(10) ≤ 208 and Qex(11) ≤ 422 | 2026-10-04 | OPEN2026-10-04 |
Bapat–Lal q-permanent Conjectures 1, 2 disproved, n = 144 | LeanProofCounterexampleStatementLinear Algebra | Strict monotonicity in q of q-permanents of positive definite matrices | Disproved in Lean the Bapat–Lal conjecture that the q-permanent of every non-diagonal Hermitian positive definite matrix is strictly increasing on [−1, 1], and da Fonseca's half-line extension, with an order-144 counterexample | 2026-10-05 | OPEN2026-10-05 |
Irrationality exponent μ(log 2) = 2 | LeanProofStatementNumber Theory | Rational approximation of the natural logarithm of 2 | Proved in Lean that the irrationality exponent of log 2 is 2, adapting OpenAI's interpolation-determinant proof that μ(π) = 2; the best published bound had been about 3.57 | 2026-10-07 | OPEN2026-10-07 |
Kalai's flag conjecture via symmetric Funk volume | LeanProofStatementDiscrete GeometryConvex Geometry | Funk-ball volumes and complete flags of centrally symmetric convex bodies | Proved in Lean the Funk-volume inequality conjectured by Faifman, Vernicos and Walsh for every centrally symmetric convex body and every radius, a family interpolating between the symmetric Mahler inequality and Kalai's flag conjecture, and derived the flag conjecture (at least 2ⁿ n! complete flags) | 2026-10-08 | OPEN2026-10-08 |
Frantzikinakis Problem 19 commuting pointwise convergence | LeanProofStatementDynamical SystemsHarmonic Analysis | Almost-everywhere convergence of multiple ergodic averages for commuting maps | Proved in Lean that the averages (1/N)Σ f(Tⁿx)g(Sⁿx) converge almost everywhere for any two commuting invertible measure-preserving transformations, answering Frantzikinakis' Problem 19, and extended the result to L² functions | 2026-10-08 | OPEN2026-10-08 |
Extended Permanence Conjecture endotactic mass-action systems | LeanProofStatementDynamical Systems | Permanence of endotactic mass-action systems with time-dependent rates | Proved in Lean the Extended Permanence Conjecture of Craciun, Nazarov and Pantea for endotactic mass-action systems with natural-number exponents, with one absorbing box for all bounded measurable rate paths | 2026-10-09 | OPEN2026-10-09 |
Auslander–Reiten / Tachikawa counterexample over ℚ | LeanProofCounterexampleStatementRepresentation Theory | Self-extensions of modules over symmetric algebras in characteristic zero | Constructed in Lean a finite-dimensional symmetric ℚ-algebra with a non-projective module whose positive self-Ext groups all vanish, a formally verified characteristic-zero counterexample to the Auslander–Reiten conjecture and to Tachikawa's second conjecture, adapting OpenAI's characteristic-two construction | 2026-10-09 | OPEN2026-10-09 |
Erdős #952 binary-form moat variants | LeanProofStatementNumber Theory | Bounded-step walks through lattice points where a binary form has few prime factors | Proposed and proved in Lean two variants of Erdős Problem 952: uniform moats for points where an irreducible binary form of degree at least 2 has at most r prime factors, and a classification showing that long bounded-step walks exist exactly for the forms c(aX+bY)^m | 2026-10-10 | SOLVED2026-10-10 |
Fisher information convexity counterexample in dimension 41 | LeanProofCounterexampleStatementProbability | Time-convexity of the Fisher information of the Gaussian heat flow in high dimension | Disproved in Lean the convexity of Fisher information along the Gaussian heat flow, Problem (iii) of Zou–Fan–Gao–Wang, with an explicit admissible density on ℝ⁴¹ whose Fisher information is strictly concave for small times | 2026-10-10 | OPEN2026-10-10 |
Hajłasz–Onninen Question 1 centered maximal W¹,¹ endpoint | LeanProofStatementHarmonic Analysis | Gradient bounds for the centered Hardy–Littlewood maximal function in W¹,¹ | Proved in Lean the Hajłasz–Onninen W¹,¹ endpoint bound ‖∇Mf‖₁ ≤ C_d‖∇f‖₁ for the centered ball maximal function in every dimension, extending OpenAI's planar proof to d ≥ 3 | 2026-10-08 | OPEN2026-10-08 |
Isometric embeddings in ℝ⁴ closed orientable surfaces | LeanProofStatementDifferential Geometry | Smooth isometric embeddings of Riemannian surfaces in Euclidean four-space | Proved in Lean that every closed orientable smooth surface with any smooth Riemannian metric admits a smooth isometric embedding into ℝ⁴, extending OpenAI's isometric immersion theorem to embeddings | 2026-10-09 | OPEN2026-10-09 |
Strong Holevo additivity arbitrary qubit channels | LeanProofStatementQuantum Information | Additivity of the Holevo information of qubit channels | Proved in Lean that χ(Φ⊗Ω) = χ(Φ) + χ(Ω) for every qubit channel Φ and every finite-dimensional channel Ω, without the unital or pure-output hypotheses of earlier theorems, and hence additivity over any number of uses of a qubit channel | 2026-10-11 | OPEN2026-10-11 |
Melbourne–Tkocz Conjecture 6.1 entropic Rogers–Shephard inequality | LeanProofStatementProbabilityConvex Geometry | Entropy of the difference of two independent log-concave random vectors | Proved in Lean the sharp entropic Rogers–Shephard inequality h(X − X′) − h(X) ≤ n log 2 for independent random vectors with a common log-concave density in every dimension, Conjecture 6.1 of Melbourne–Tkocz, with equality examples and optimality of the constant | 2026-10-12 | OPEN2026-10-12 |
Kalai's 3^d conjecture dimension five | LeanProofStatementConvex GeometryCombinatorics | Nonempty faces of centrally symmetric convex polytopes | Formalized Kalai's 3^d conjecture and submitted a Lean proof of the dimension-five bound of 243 nonempty faces; the general conjecture remains open | 2026-10-11 | OPEN2026-10-11 |
Finitely presented residually finite p-groups every prime | LeanProofStatementGroup Theory | All-prime strengthening of the finitely presented Burnside problem | Formalized the finitely presented Burnside problem and proved in Lean the stronger all-prime variant: an infinite finitely presented residually finite p-group exists for every prime p, extending the earlier p=2 result | 2026-10-13 | OPEN2026-10-13 |
Simultaneous primitive roots unconditional positive lower density | LeanProofStatementAnalytic Number Theory | Primes for which every member of a finite set is a primitive root | Proved in Lean the unconditional bound N_A(x) ≥ c_A x/log x for positive integer bases satisfying the square condition, and the prime-base c_A x/(log x)^2 corollary without the four analytic hypotheses | 2026-10-09 | OPEN2026-10-09 |
Infinity Laplacian interior regularity with bounded forcing | LeanProofStatementPartial Differential Equations | Interior gradient regularity for viscosity solutions of the infinity Laplace equation | Proved in Lean interior C¹,α estimates for |Δ∞u| ≤ M in every dimension n ≥ 2, with forcing term (RM)^(1/3), and formalized the homogeneous theorem and its scaling corollary | 2026-10-12 | OPEN2026-10-12 |
Sphere energy and cap discrepancy dimensions 2, 8 and 24 | LeanProofStatementPotential TheoryDiscrete Geometry | Lattice coefficients in optimal Riesz energy, logarithmic energy and cap discrepancy | Proved in Lean the predicted lattice coefficients for Riesz energy (−2 < s < d, s ≠ 0), logarithmic energy and spherical cap L² discrepancy on S², S⁸ and S²⁴; general dimensions and d=4 remain open | 2026-10-14 | OPEN2026-10-14 |
Reversible Finsler spheres infinitely many closed geodesic images | LeanProofStatementDifferential GeometryDynamical Systems | Geometrically distinct closed geodesics for arbitrary reversible Finsler metrics | Proved in Lean infinitely many geometrically distinct prime closed geodesics for every smooth strongly convex reversible Finsler metric on Sⁿ, n ≥ 3; the n=2 case is cited from the literature | 2026-10-09 | OPEN2026-10-09 |
Green #14 explicit colouring witnessing W(3,r) ≥ 2r² | LeanProofAdditive CombinatoricsNumber Theory | An explicit asymmetric van der Waerden colouring avoiding red triples and long blue progressions | Constructed a deterministic colouring witnessing W(3,r) ≥ 2r² for r = 520822699705116213452472320 and proved its correctness in Lean; Comparator, nanoda and Lean kernel verification passed | 2026-11-18 | OPEN2026-11-18 |
Erdős #104 variant exact count of unit-circumradius triples | LeanProofStatementDiscrete GeometryCombinatorics | Triples on unit circles in planar point sets not contained in one unit circle | Determined in Lean g(2)=g(3)=0 and g(n)=binom(n−1,3)+n−2+1_{3 divides n−1} for n≥4; every n≥4 maximizer has n−1 points on one unit circle | 2026-11-19 | OPEN2026-11-19 |