Erdős Problem #501 shown independent of ZFC, with both directions in Lean
GitHub: Erdős Problem #501 in Lean 4
New proofs, counterexamples, bounds and formalizations reported by people and AI systems, newest first.
GitHub: Erdős Problem #501 in Lean 4
Zenodo: the DeLaViña-Waller conjecture on the Wiener index
Counterexample to the smooth Carathéodory conjecture on umbilic points
arXiv: large finite point sets have 4 collinear points or a 6-clique
arXiv: A dimension-free weak-type (1,1) bound for the vector Riesz transform
Axiom Math: Lean formalization of bounded gaps between primes
arXiv: Improving the matrix multiplication exponent with modern optimization and AlphaEvolve
arXiv: Weak-Type Bounds for Convolution on the Boolean Hypercube
A lower bound about 67.250% for simple critical-line zeros; a related distinct-zero bound about 83.625% is also reported.
arXiv: A solution to Banach's isometric conjecture
arXiv: No compromise in the liquid drop model
Zenodo: A Counterexample to Prescribed-Cycle Recovery in Barnette Graphs
Anthropic: paper (PDF)
arXiv: a solution to the inverse generator problem and related questions
Sendov is reported for all degrees; the stricter distance conclusion and exceptional equality cases are addressed by the same argument.
Noncircular counterexamples are reported, including a real-analytic Jordan domain from computer-assisted existence estimates and a separate bifurcation construction.
ProofAtlas: A Computer-Assisted Proof of Sendov's Conjecture (PDF)
arXiv: Asymptotically attaining the Moore bound
Lean 4 certificates for all ten results
arXiv: Settling the Optimal Exponent Relating Sumsets and Difference Sets
A MAX CUT reduction establishes NP-completeness of the decision version and hardness of the optimization problem.
A sharp finite-n bound, and bounds for general δ, are reported; the δ≥1 conclusion settles the stated Feige assertion if the proof is valid.
A seven-vertex, nine-arc witness: fractional cost 58; every allowed unsplittable routing costs at least 60, with demands 15,10,15.
For the specified one-cluster automata with cycle length m and positive level ℓ, a reset-word bound (m-1)(n-1)+mℓ≤(n-1)² is reported.
A proof of the modulo-four assertion is reported.
A proof is reported in a July preprint.
Explicit three-variable polynomials with the first expectation zero and the second equal to m! for every m≥1; hence failure in all n≥3.
A proof of the strong Gaussian product inequality conjecture
An explicit map in C^3 with det JF=-2 and three different points having the same image; padding gives higher-dimensional counterexamples.
A near-quadratic lower bound is reported, with formal proof artifacts.