Open registry federation

Mathematical findings

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

combinatoricsJul 21, 2026Significance 20/100Registry: unreviewed

Norine's Antipodal-Colouring Conjecture

Prior state unknown→proved

VibeMathed recorded: Norine's Antipodal-Colouring Conjecture. Consult the linked registry entry for the original report and scope.

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review
algebraJul 23, 2026Significance 20/100Registry: unreviewed

Commutator Relators Do Not Force Hopficity, Residual Finiteness or Automaticity

Prior state unknown→disproved

VibeMathed recorded: Commutator Relators Do Not Force Hopficity, Residual Finiteness or Automaticity. Consult the linked registry entry for the original report and scope.

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

Maximum Entropy of Sums of Independent Ternary Random Variables

Prior state unknown→proved

VibeMathed recorded: Maximum Entropy of Sums of Independent Ternary Random Variables. Consult the linked registry entry for the original report and scope.

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review
differential-equationsMay 11, 2026Significance 20/100Registry: unreviewed

The Jauslin-Kreiss-Moser Vanishing-Viscosity Selection Problem

Prior state unknown→disproved

VibeMathed recorded: The Jauslin-Kreiss-Moser Vanishing-Viscosity Selection Problem. Consult the linked registry entry for the original report and scope.

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review
geometry-topologyAug 4, 2026Significance 20/100Registry: unreviewed

Uniform Székelyhidi conjectures for complex Hessian equations on projective manifolds

Prior state unknown→proved

Chen, Nie and Xu prove a Nakai–Moishezon-type numerical criterion for a broad class of complex Hessian-type equations on compact projective manifolds. In particular, Corollary 1.3 gives a uniform version of Székelyhidi’s conjecture for complex Hessian quotient equations, while Corollary 1.5 proves the uniform version, formulated by Murakami, for complex k-Hessian equations. However, the results assume projectivity a…

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

Optimal Vector Balancing for Zonotopes

Prior state unknown→proved

VibeMathed recorded: Optimal Vector Balancing for Zonotopes. Consult the linked registry entry for the original report and scope.

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review
geometry-topologyJul 21, 2026Significance 20/100Registry: unreviewed

The mod 4 Kawauchi Conjecture

Prior state unknown→proved

the mod 4 form; the general conjecture is false by Ermotti, Hongler and Weber

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review
theoretical-computer-scienceMay 29, 2026Significance 20/100Registry: unreviewed

Steurer's Conjecture on Vectors with Small Average Correlation

Prior state unknown→disproved

VibeMathed recorded: Steurer's Conjecture on Vectors with Small Average Correlation. Consult the linked registry entry for the original report and scope.

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review
theoretical-computer-scienceJun 24, 2026Significance 20/100Registry: unreviewed

Quadratic-Time Hardness of Furthest Pair in Superconstant Dimension

Prior state unknown→proved

VibeMathed recorded: Quadratic-Time Hardness of Furthest Pair in Superconstant Dimension. Consult the linked registry entry for the original report and scope.

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

Word-length spectral triples as compact quantum metric spaces

Prior state unknown→disproved

The first explicit counterexample rather than a first suspicion: the abstract is clear that the failure was widely expected and that what was missing was a witness. It gives an infinite family, one for each d >= 2, all Lamplighter groups over free groups.

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review
algorithms-optimizationJul 22, 2026Significance 20/100Registry: unreviewed

Dinitz-Garg-Goemans Conjecture

Prior state unknown→disproved

VibeMathed recorded: Dinitz-Garg-Goemans Conjecture. Consult the linked registry entry for the original report and scope.

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review
algebraJul 27, 2026Significance 20/100Registry: unreviewed

Infinitely Many Components in Auslander–Reiten Quivers over Perfect Fields

Prior state unknown→proved

VibeMathed recorded: Infinitely Many Components in Auslander–Reiten Quivers over Perfect Fields. Consult the linked registry entry for the original report and scope.

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review
combinatoricsSep 1, 2026Significance 18/100Registry: unreviewed

Common Neighbour Conjectures for Saxl Graphs

Prior state unknown→disproved

The paper disproves both the Burness–Giudici common neighbour conjecture for primitive groups of base size 22 and its later generalisation to arbitrary base size. For every integer B≥2B\ge2, it constructs infinitely many primitive permutation groups of base size BB whose generalised Saxl graphs contain two nonadjacent vertices with no common neighbour. At base size 22, it gives infinite counterexample families of…

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review
algorithms-optimizationAug 29, 2026Significance 18/100Registry: unreviewed

Improving Randomized Metric Distortion to 2.3282

Prior state unknown→proved

The paper proves that there exists a randomized voting rule using only ordinal rankings with metric distortion at most 11641/5000=2.328211641/5000=2.3282. This improves the previous best upper bound of 2.52.5 and closes about 44%44\% of the gap to the known asymptotic lower bound of approximately 2.11262.1126. It does not determine the optimal randomized metric distortion: for m≥4m\ge4, the exact optimum and its asymptotic limit remain o…

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review
algebraAug 21, 2026Significance 18/100Registry: unreviewed

The stable commutator length of a relator is not a one-relator group invariant

Prior state unknown→disproved

A negative answer to Heuer and Löh's question: the isomorphism type of a one-relator group ⟨S∣r⟩\langle S \mid r\rangle does not determine sclS(r)\mathrm{scl}_S(r). The witnesses are r=aabABabABBAbaabABBAbr=\mathtt{aabABabABBAbaabABBAb} and r′=aabABabABabABBAbaBAbr'=\mathtt{aabABabABabABBAbaBAb}, both length 20 in F2′F_2', with ⟨a,b∣r⟩≅⟨a,b∣r′⟩\langle a,b \mid r\rangle\cong\langle a,b\mid r'\rangle but scl(r)=1\mathrm{scl}(r)=1 against scl(r′)=1/2\mathrm{scl}(r')=1/2. The mechanism is what ma…

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review
analysisMar 23, 2026Significance 18/100Registry: unreviewed

Lower Bounds for Lebesgue Constants and an Erdős-Turán Interpolation Problem

Prior state unknown→proved

VibeMathed recorded: Lower Bounds for Lebesgue Constants and an Erdős-Turán Interpolation Problem. Consult the linked registry entry for the original report and scope.

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

The Simonovits Product Conjecture

Prior state unknown→disproved

one construction disproves both the product conjecture and its weak form

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review
theoretical-computer-scienceAug 8, 2026Significance 18/100Registry: unreviewed

Polynomial-Time MIMO Detection at the ML Threshold

Prior state unknown→proved

An average-case claim about the Gaussian model, not a contradiction of the worst-case NP-hardness of integer least squares. If it holds, no computational-statistical gap separates polynomial-time detection from exhaustive maximum likelihood at first order in this model.

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review