Open registry federation

Mathematical findings

690 source-grounded records. Verification labels remain separate from source authentication and publication status.

Editorial data from VibeMathed is CC BY 4.0 licensed. Linked papers and authors’ text retain their own rights. Each record links to its registry entry and primary source. Verification labels are attributed to the registry.

quantum-information-computingAug 9, 2026Significance 30/100Registry: unreviewed

Finite-Copy Distillability of NPT States in the DiVincenzo Family

Prior state unknown→disproved

Partial deliberately: the NPT bound entanglement problem itself is untouched. What falls is the conjecture about the canonical family, and the paper is explicit that a substantial neighbouring region remains unresolved while another is known two-copy undistillable.

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review
combinatoricsAug 3, 2026Significance 30/100Registry: unreviewed

The Mihail-Vazirani Conjecture

Prior state unknown→disproved

VibeMathed recorded: The Mihail-Vazirani Conjecture. Consult the linked registry entry for the original report and scope.

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review
combinatoricsMay 26, 2026Significance 30/100Registry: site confirmed

Borsuk Conjecture lowest-ever counterexample (N=63)

Prior state unknown→disproved

Priority: the result was first obtained by Max Grinsztajn with GPT-5.5 Pro assistance, published 26 May 2026 and recorded as the current best bound on Tao's optimization-problems ledger. The same construction was found again independently in August 2026 by Nicholas Konz working with Claude, with a different derivation and a fuller AI disclosure; the two efforts were evidently unaware of each other, and the submitter…

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review
analysisAug 20, 2026Significance 30/100Registry: unreviewed

Smooth Random Fast Dynamo on the Three-Torus

Prior state unknown→proved

Constructed an explicit class of smooth random, time-dependent incompressible velocity fields on T^3, obtained by alternating smooth shear flows with iid random phases on finite time blocks. For every fixed sufficiently small resistivity, the magnetic field has an almost-sure exponential growth rate at least 1/2, together with a time-uniform lower bound whose random prefactor has a resistivity-uniform inverse-moment…

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review
mathematical-physicsAug 9, 2026Significance 30/100Registry: unreviewed

Talagrand's critical Sherrington-Kirkpatrick overlap conjecture

Prior state unknown→proved

Talagrand's Conjecture 11.7.5 is resolved affirmatively for the critical Ising Sherrington-Kirkpatrick model: N2/3E⟨R1,22⟩N^{2/3}\mathbb{E}\langle R_{1,2}^2\rangle converges to a positive finite constant. The paper proves substantially more, showing that the entire quenched distribution of N1/3R1,2N^{1/3}R_{1,2} converges to an explicit random probability measure defined from the reflected Airy1\mathrm{Airy}_1 point process. The same…

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review
analysisAug 12, 2026Significance 30/100Registry: lean verified

Phelps–Rodriguez Conjecture

Prior state unknown→proved

Phelps-Rodriguez implies Sendov, so this entry records the stronger of the pair; the companion Sendov entry records the weaker statement and Mazur's original formalization, which proved Sendov but never stated the equality classification. The exceptional family is genuinely attained rather than an artefact of the proof: for p = z^n - 1 and a = 1 the only critical point is the origin, at distance exactly 1. Both conj…

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review
combinatoricsAug 12, 2026Significance 30/100Registry: unreviewed

Seymour's Second Neighborhood Conjecture

Prior state unknown→proved

A dense case, not the conjecture: it remains open in general. The concrete gain is on the size of any counterexample - combined with the known minimum-outdegree results, this raises the best known lower bound on the order of a counterexample from 16 to 17, and to 19 conditional on the 2026 preprint of Sadhukhan, Sandeep and Sen. The novelty against the earlier dense-case work is that no structure is prescribed on th…

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review
combinatoricsAug 6, 2026Significance 30/100Registry: unreviewed

Babai's Minimal Cayley Graph Problem

Prior state unknown→disproved

VibeMathed recorded: Babai's Minimal Cayley Graph Problem. Consult the linked registry entry for the original report and scope.

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review
analysisAug 5, 2026Significance 30/100Registry: unreviewed

Rivière’s regularity question for critical nn-Laplace systems with antisymmetric potentials

Prior state unknown→disproved

For every n>2n>2, the paper constructs a bounded map U∈W1,n(Bn,Rn+2)U\in W^{1,n}(B^n,\mathbb{R}^{n+2}), smooth on Bn∖{0}B^n\setminus\{0\} but discontinuous at the origin, together with an antisymmetric potential Ω∈Ln(Bn,so(n+2)⊗Rn) \Omega\in L^n(B^n,so(n+2)\otimes\mathbb{R}^n) such that −Div(∣∇U∣n−2∇U)=Ω⋅∣∇U∣n−2∇Uin D′(Bn). -\mathrm{Div}\bigl(|\nabla U|^{n-2}\nabla U\bigr) = \Omega\cdot|\nabla U|^{n-2}\nabla U \qquad\text{in }D'(B^n). Moreover, the potential satisfies the sh…

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review
probability-statisticsAug 10, 2026Significance 30/100Registry: unreviewed

The Ellipsoid Fitting Conjecture

Prior state unknown→proved

Closes both gaps left open by Bandeira and Maillard: exact fitting, and removal of the operator-norm constraint. The threshold turns out to be governed by the statistical dimension d(d+1)/4 of the PSD cone.

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review
mathematical-physicsAug 3, 2026Significance 30/100Registry: unreviewed

Autonomous Lipschitz Fast Dynamo on the Three-Torus

Prior state unknown→proved

One variant case of Arnold's 1994 fast-dynamo problem, not the problem itself. Arnold asks for a single velocity field on T^3 that is smooth, divergence-free, autonomous and deterministic, fixed independently of the magnetic diffusivity, and that grows the magnetic field exponentially at every small enough diffusivity. The field constructed here is all of that except smooth: it is Lipschitz, not C^1. The sibling ent…

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review
probability-statisticsJun 21, 2026Significance 30/100Registry: lean verified

Kannan–Tetali–Vempala conjecture (bipartite/binary-matrix case)

Prior state unknown→proved

VibeMathed recorded: Kannan–Tetali–Vempala conjecture (bipartite/binary-matrix case). Consult the linked registry entry for the original report and scope.

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review
combinatoricsMay 13, 2026Significance 30/100Registry: unreviewed

Ben Green's Open Problem 90

Prior state unknown→proved

VibeMathed recorded: Ben Green's Open Problem 90. Consult the linked registry entry for the original report and scope.

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review
combinatoricsAug 12, 2026Significance 30/100Registry: site confirmed

Hadamard Matrix of Order 668

Prior state unknown→proved

Explicit construction of a Hadamard matrix of order 668, the smallest previously unresolved order, verified exactly by this site from the announcement plus its decoder reply. The same post encodes matrices for all twelve previously-open admissible orders below 2000 (668, 716, 892, 1132, 1244, 1388, 1436, 1676, 1772, 1916, 1948, 1964), and this site verified every one of them. The entry records the order-668 existenc…

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review
combinatoricsJul 2, 2026Significance 30/100Registry: unreviewed

Log-Concavity of Flats of Matroids

Prior state unknown→disproved

Refuting log-concavity of the flat counts is weaker than refuting their unimodality, since log-concavity is the stronger property. A counterexample to unimodality followed three weeks later and is tracked separately as Rota's Unimodality Conjecture for Matroid Flats; this paper came first.

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review
probability-statisticsJul 20, 2026Significance 30/100Registry: unreviewed

Universal Multiplicative FDR Bound for Benjamini-Hochberg

Prior state unknown→disproved

VibeMathed recorded: Universal Multiplicative FDR Bound for Benjamini-Hochberg. Consult the linked registry entry for the original report and scope.

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review
combinatoricsAug 26, 2026Significance 30/100Registry: unreviewed

Rapid mixing for spin systems on graphs of girth at least five

Prior state unknown→proved

For fixed δ∈(0,1)\delta\in(0,1) and all sufficiently large Δ\Delta depending only on δ\delta, Glauber dynamics for proper qq-colorings mixes rapidly on every graph of girth at least 55 whenever q≥(1+δ)Δq\ge(1+\delta)\Delta: spectral gap Ωδ(1/n)\Omega_\delta(1/n) and tmix(ε)=Oδ(n2log⁡q+nlog⁡(1/ε))t_{\mathrm{mix}}(\varepsilon)=O_\delta(n^2\log q+n\log(1/\varepsilon)). An analogous theorem holds for the anti-ferromagnetic Potts model at…

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review
combinatoricsAug 5, 2026Significance 30/100Registry: lean verified

The Divisible Rank-Three Case of the Kajitani–Ueno–Miyano Conjecture

Prior state unknown→proved

Proves the divisible rank-three case: rank exactly three and ground-set size a multiple of three, with no restriction to simple, paving, representable or graphic matroids. The part not previously in the literature is the non-simple sub-case, since McGuinness had settled all paving matroids and a rank-three matroid is paving exactly when it has no parallel pairs. Combined with the coprime-case theorem of van den Heuv…

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review
analysisAug 13, 2026Significance 28/100Registry: unreviewed

The Radchenko–Viazovska question on Fourier interpolation

Prior state unknown→disproved

For every 0≤β≤120\le \beta\le \tfrac12, Bondarenko and Seip construct a nonzero real-valued continuous even function fβ∈L1(R)∩L2(R) f_\beta\in L^1(\mathbb R)\cap L^2(\mathbb R) such that f^β=fβ \widehat f_\beta=f_\beta and fβ ⁣(n[log⁡(e+n)]β)=0(n≥0). f_\beta\!\left(\frac{\sqrt n}{[\log(e+n)]^\beta}\right)=0 \qquad(n\ge0). They normalize the construction by requiring fβ(1/2)=1f_\beta(1/2)=1, so the function is genuinely nontrivial. For β=0\beta=0, this gives…

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review
algebraSep 3, 2026Significance 28/100Registry: site confirmed

Conway's Refinement Conjecture for Omnific Integers

Prior state unknown→proved

The repository gives a Lean proof of Conway's 1976 refinement conjecture for omnific integers: whenever ab=cd ab=cd with a,b,c,d∈Oza,b,c,d\in\mathbf{Oz}, there exist e,f,g,h∈Oze,f,g,h\in\mathbf{Oz} satisfying a=ef,b=gh,c=eg,d=fh. a=ef,\quad b=gh,\quad c=eg,\quad d=fh. The proof is formalized twice: once using CombinatorialGames' surreal-number implementation and once with the required surreal definitions inlined over Mathlib. The development also…

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review
combinatoricsAug 19, 2026Significance 28/100Registry: unreviewed

The Kára–Pór–Wood Big-Line-Big-Clique Conjecture: Four Collinear Points or a Six-Clique

Prior state unknown→proved

VibeMathed recorded: The Kára–Pór–Wood Big-Line-Big-Clique Conjecture: Four Collinear Points or a Six-Clique. Consult the linked registry entry for the original report and scope.

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review
mathematical-physicsAug 6, 2026Significance 28/100Registry: unreviewed

The Gardner Transition in the Ising pure pp-spin glass

Prior state unknown→proved

For the Ising pure pp-spin glass where p≥3p \geq 3, it was predicted by Gardner that there exists critical inverse temperatures 0<β1p<β2p<∞0<\beta_1^p<\beta_2^p <\infty such that: (1) When 0<β≤β1p0<\beta\leq \beta_1^p, the Parisi measure is replica symmetric (RS); (2) When β1p<β≤β2p\beta_1^p<\beta \leq \beta_2^p, the Parisi measure is one-step replica symmetry breaking (1-RSB); (3) When β>βp2\beta>\beta_p^2, the Parisi measure is full rep…

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review
algorithms-optimizationMay 21, 2026Significance 28/100Registry: unreviewed

The Optimal Approximation Ratio for Permanents of PSD Matrices

Prior state unknown→proved

VibeMathed recorded: The Optimal Approximation Ratio for Permanents of PSD Matrices. Consult the linked registry entry for the original report and scope.

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review
analysisAug 25, 2026Significance 27/100Registry: unreviewed

Sparse domination implies convex body domination

Prior state unknown→proved

If a bilinear form admits an (r,s)(r,s)-sparse bound, its coordinate-wise extension to Cn\mathbb C^n-valued functions admits an (r,s)(r,s)-convex body sparse bound, for 1≤r,s<∞1\le r,s<\infty with 1r+1s>1\tfrac1r+\tfrac1s>1. It holds both in a fixed dyadic lattice (Theorem 2.6, constants independent of the ambient dimension) and for arbitrary cubes (Theorem 3.4), via a randomization of the good part of the form. On scope, two thin…

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review
logic-foundationsAug 31, 2026Significance 26/100Registry: unreviewed

A Counterexample to the Stable Forking Conjecture

Prior state unknown→disproved

The paper constructs a simple theory in which forking cannot always be witnessed by a stable formula. Precisely, what fails is: in a simple theory, if a̸↓Cba \not\downarrow_C b then there is φ(x,bˉ)∈tp(a/Cb)\varphi(x,\bar b) \in \mathrm{tp}(a/Cb) forking over CC whose parameter-free form φ(x,y)\varphi(x,y) is stable. The counterexample is an infinite-dimensional vector space over the division ring of fractions of the quantum graph alg…

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review
combinatoricsSep 2, 2026Significance 25/100Registry: unreviewed

The Daykin–Frankl conjecture on convex subsets of the Boolean lattice

Prior state unknown→proved

Let P⊆QnP\subseteq Q_n be convex. Williams proves the stronger statement that for every k≥0k\ge0, w(P×Qk)≥w(Qn+k) ∣P∣ 2−n, w(P\times Q_k) \ge w(Q_{n+k})\,|P|\,2^{-n}, where ww denotes poset width. Taking k=0k=0 gives w(P)≥∣P∣(n⌊n/2⌋)2−n, w(P)\ge |P|\binom{n}{\lfloor n/2\rfloor}2^{-n}, which is exactly the Daykin-Frankl conjecture. The proof proceeds by induction on nn, reducing the step to a structural lemma for a convex subset of R×Q1R\times Q_1 and…

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review