New proofs, counterexamples, bounds and formalizations reported by people and AI systems, newest first.

Reported developments, attributed to their sources. Inclusion is not an OpenMath assessment; evidence slots show what each source reports. Updated Oct 13, 2026.

October 2026 20

CounterexampleCombinatoricsopenai/math #156

Borsuk's conjecture fails in dimension nine

Constructs a compact subset of ℝ9 that cannot be covered by ten sets of strictly smaller diameter, disproving Borsuk's covering assertion already in dimension nine. The example consists of rank-one orthogonal projectors onto lines in ℝ4, with the Frobenius metric.

Unreleased OpenAI model
LFCR
CounterexampleCombinatoricsopenai/math #155

A counterexample to periodic tiling in dimension three

Constructs a finite translational tile in ℤ3 that tiles space but admits no fully periodic tiling, disproving the periodic tiling conjecture in the smallest possible lattice dimension. Its unit-cube thickening gives the same counterexample in ℝ3, even with arbitrary real translation vectors.

Unreleased OpenAI model
LFCR
CounterexampleAnalysisopenai/math #151

A C1 counterexample to the entropy conjecture

Constructs a noninvertible C1 self-map of a compact smooth manifold with zero topological entropy but eigenvalue 2 on second homology. This disproves the homological entropy lower bound for general C1 self-maps: homological growth need not force positive orbit complexity.

Unreleased OpenAI model
LFCR
CounterexampleTheoretical computer scienceopenai/math #132

A superquadratic separation of sensitivity and block sensitivity

Constructs total Boolean functions with block sensitivity bs(f)≥s(f)α\mathop{\mathrm{bs}}\nolimits (f)\ge s(f)^\alpha for a fixed α > 2, disproving the quadratic strengthening of the Sensitivity Conjecture. Here s(f)s(f) counts influential individual-bit flips, while block sensitivity allows disjoint groups of bits to change together.

Unreleased OpenAI model
LFCR
CounterexampleTheoretical computer scienceopenai/math #118

Bin packing and unbounded configuration-LP gaps

Disproves the modified integer round-up conjecture of Scheithauer and Terno: the integral bin-packing optimum can exceed its configuration linear-programming value by an arbitrarily large additive constant. Approximating the optimum within any fixed additive constant is also NP-hard, even when every item exceeds 1/6 and each bin holds at most five items.

Unreleased OpenAI model
LFCR
CounterexampleTheoretical computer scienceopenai/math #109

Integer multiplication below nlog⁡nn\log n

Multiplies two n-bit integers exactly at every input length in deterministic worst-case time O(n(log⁡n)1−κ)O(n(\log n)^{1-\kappa}), with κ=2−182\kappa=2^{-182}, on one fixed finite-alphabet Turing machine with finitely many one-dimensional tapes. This disproves the Schönhage–Strassen nlog⁡nn\log n optimality conjecture in the ordinary multitape bit model.

Unreleased OpenAI model
LFCR
CounterexampleGeometry and topologyopenai/math #100

Cylinder coverings below the half-area bound

Covers the entire closed regular tetrahedron by finitely many cylinders with compact triangular perpendicular bases whose total area is less than half its smallest orthogonal projection area. This disproves Bang's half-area cylinder-covering bound and the stronger directionwise normalized conjecture in dimension three.

Unreleased OpenAI model
LFCR
CounterexampleGeometry and topologyopenai/math #098

Compact counterexamples to bi-Lipschitz dimension reduction

Every infinite-dimensional real Banach space contains a compact doubling set that admits no bi-Lipschitz embedding into any finite-dimensional normed space. The doubling constant is universal. This answers the Lang–Plaut problem negatively, even for compact subsets of Hilbert space.

Unreleased OpenAI model
LFCR
CounterexampleGeometry and topologyopenai/math #095

Hyperbolicity cones without semidefinite lifts

Disproves the Projected Lax conjecture: some hyperbolicity cones are not spectrahedral shadows. The examples admit no exact finite affine semidefinite lift, regardless of the number of auxiliary variables or the real coefficients used. This also disproves the generalized Lax conjecture that every hyperbolicity cone is spectrahedral.

Unreleased OpenAI model
LFCR
CounterexampleGeometry and topologyopenai/math #088

Sharp projection-body inequalities and a counterexample to simplex maximization

Proves Petty's projection-volume conjecture in the remaining dimensions n ≥ 4: ellipsoids uniquely minimize projection-body volume at fixed body volume. Also establishes the full Lutwak–Petty projection inequalities. In contrast, products of simplices exceed Brannen's proposed simplex maximum for normalized projection-body volume by an exponential factor in every sufficiently large dimension.

Unreleased OpenAI model
LFCR
CounterexampleAnalysisopenai/math #076

Real ultraflat Littlewood polynomials and unbounded binary merit factors

Constructs polynomials with N consecutive coefficients in {−1,1}\{-1,1\} whose modulus is (1+o(1))N(1+o(1))\sqrt N uniformly on the entire unit circle, for every sufficiently large integer length N. Thus real Littlewood polynomials are ultraflat, including at the real endpoints. Their binary merit factors tend to infinity, disproving Turyn's bounded-merit-factor conjecture.

Unreleased OpenAI model
LFCR
CounterexampleAnalysisopenai/math #072

Brennan's conjecture and the integral-means spectrum

Proves Brennan's conjecture: for every conformal bijection ϕ from a simply connected plane domain onto the disk, ∣ϕ′∣s|\phi'|^s is area-integrable for 4/3<s<44/3\lt s\lt 4. The sharp universal integral-means identity is BS(t)=∣t∣−1B_{\mathcal S}(t)=|t|-1 for t ≤ −2. A strict bound Bb(−1)<1/4B_b(-1)\lt 1/4 for bounded univalent functions disproves Kraetzer's prediction at that parameter.

Unreleased OpenAI model
LFCR
CounterexampleGeometry and topologyopenai/math #059

Counterexamples to Zariski’s multiplicity conjecture

Disproves Zariski's multiplicity conjecture by constructing reduced holomorphic hypersurface germs that are ambiently homeomorphic but have different multiplicities. The examples include hypersurfaces in ℂ4 with isolated critical points and multiplicities four and five.

Unreleased OpenAI model
LFCR
CounterexampleGeometry and topologyopenai/math #054

Irrational cubic fourfolds with Hodge-theoretic and categorical K3 associations

For every sufficiently large admissible Hassett discriminant, a very general smooth complex cubic fourfold is irrational despite having both an untwisted geometric K3 category and an integral Hodge-theoretic K3 association. This disproves Kuznetsov's rationality conjecture and the sufficiency of the associated-K3 criterion for rationality; the discriminant threshold is ineffective.

Unreleased OpenAI model
LFCR
CounterexampleGeometry and topologyopenai/math #053

A counterexample to Pixton completeness in Chow

Constructs a tautological relation on a moduli space of stable pointed curves that vanishes in rational Chow, hence in rational cohomology, but lies outside Pixton's original relation span. This disproves the Chow and rational-cohomological forms of his original completeness conjecture.

Unreleased OpenAI model
LFCR
CounterexampleGeometry and topologyopenai/math #050

A counterexample to Griffiths’ positivity conjecture

Constructs ample rank-two bundles on P1×P1\mathbb P^1\times\mathbb P^1 with no smooth Hermitian metric of strictly Griffiths-positive curvature, disproving Griffiths' positivity conjecture already on the quadric surface.

Unreleased OpenAI model
LFCR
CounterexampleGeometry and topologyopenai/math #049

A stable-coordinate counterexample in four variables

Constructs a polynomial in four complex variables that is not a coordinate but becomes one after adjoining a single variable, disproving the Stable Coordinate conjecture in four variables. Every fiber is affine three-space, yet none of its embeddings is rectifiable, also disproving the Abhyankar–Sathaye conjecture even when all fibers are affine spaces.

Unreleased OpenAI model
LFCR
CounterexampleGeometry and topologyopenai/math #048

A characteristic-zero counterexample to Lipman–Zariski

Constructs a singular normal affine complex surface with free rank-two tangent sheaf, disproving the characteristic-zero Lipman–Zariski conjecture.

Unreleased OpenAI model
LFCR
CounterexampleGeometry and topologyopenai/math #047

Zariski cancellation and affine fibrations over the complex numbers

Constructs an integral complex affine fourfold X≇A4X\not\cong\mathbb A^4 with X×A1≅A5X\times\mathbb A^1\cong\mathbb A^5, disproving affine-space cancellation over ℂ in dimension four. It also disproves the Dolgachev–Weisfeiler affine-fibration conjecture: smooth surjections X→A1X\to\mathbb A^1 and A5→A2\mathbb A^5\to\mathbb A^2 have every residue-field fiber isomorphic to affine three-space but are not Zariski-locally trivial.

Unreleased OpenAI model
LFCR
CounterexampleGeometry and topologyopenai/math #046

Shafarevich counterexamples in dimension two and with large fundamental group

Constructs a smooth projective complex fourfold with large fundamental group whose universal cover contains no positive-dimensional compact analytic subvariety but is neither Stein nor holomorphically convex. A separate smooth projective complex surface already disproves unrestricted Shafarevich holomorphic convexity in dimension two.

Unreleased OpenAI model
LFCR

September 2026 4

CounterexampleTheoretical computer science

Pinwheel scheduling kernel conjecture

A six-task counterexample is reported; exact periods and the reduction rule must be taken from the original witness before publishing.

GPT-6 Astra · Codex
LFCR

August 2026 7

CounterexamplePDE and mathematical physics

Planar Schiffer / Pompeiu rigidity

Noncircular counterexamples are reported, including a real-analytic Jordan domain from computer-assisted existence estimates and a separate bifurcation construction.

GPT-5.6 · Claude Opus 4.8 · Claude Fable 5 · Gonzalo Cao-Labora · Jaume de Dios PontSchiffer and Pompeiu conjectures →
LFCR

July 2026 2

May 2026 1

February 2026 1

CounterexampleTheoretical computer scienceGemini case 3.1

Submodular welfare

Case 3.1 in the Gemini Deep Think research report (counterexample).

Gemini Deep Think research version · Google DeepMind
LFCR

Date not recorded 1

CounterexampleCombinatorics

Devin graph and spectral-conjecture results

Nine-vertex Brandt counterexample; proofs for WoW 698 and Graffiti 39/40; independent refutations for Graffiti 143/154 with explicit earlier-priority qualification.

LFCR