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.

analysisJul 29, 2026Significance 20/100Registry: unreviewed

The Lukic Conjecture

Prior state unknown→disproved

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

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review
analysisJul 29, 2026Significance 20/100Registry: unreviewed

Fuglede's Conjecture on Square-Free Cyclic Groups With Rapidly Growing Primes

Prior state unknown→proved

A partial result. Fuglede's conjecture remains open for finite cyclic groups generally; this settles an infinite family and, for the spectral-to-tiling direction, only under rapid growth of the prime factors.

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

The Weak Simplex Conjecture

Prior state unknown→proved

VibeMathed recorded: The Weak Simplex Conjecture. 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
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
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
analysisMay 23, 2026Significance 20/100Registry: unreviewed

Brezis's Problems on Degenerate Constants in Degree Inequalities

Prior state unknown→proved

VibeMathed recorded: Brezis's Problems on Degenerate Constants in Degree Inequalities. 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
logic-foundationsAug 27, 2026Significance 18/100Registry: unreviewed

Failure of Higher-Order Truth within Intuitionistic Propositional Logic

Prior state unknown→disproved

The paper proves that not every Heyting algebra can occur as the lattice of subterminal objects of an elementary topos. Specifically, the free Heyting algebra F2F_2 on two generators cannot occur. Using Bellissima’s representation F2↪O↑(K2)F_2\hookrightarrow\mathcal O_\uparrow(K_2), the authors construct an upward-closed subset A⊆K2A\subseteq K_2 with A∉F2A\notin F_2. They show that if some elementary topos E\mathcal E satis…

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
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
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
combinatoricsMay 19, 2026Significance 17/100Registry: unreviewed

Conjectures of Hopkins, Sagan-Wilson and Defant et al. on Lattices, Parking Functions and the Plactic Monoid

Prior state unknown→proved

VibeMathed recorded: Conjectures of Hopkins, Sagan-Wilson and Defant et al. on Lattices, Parking Functions and the Plactic Monoid. Consult the linked registry entry for the original report and scope.

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review
algebraJul 20, 2026Significance 16/100Registry: lean verified

Kourovka Problem 3.46 - Maximal Locally Soluble Normal Subgroups

Prior state unknown→proved

VibeMathed recorded: Kourovka Problem 3.46 - Maximal Locally Soluble Normal Subgroups. Consult the linked registry entry for the original report and scope.

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review
quantum-information-computingAug 20, 2026Significance 16/100Registry: unreviewed

The Fractional Colouring Conjecture for Triply Efficient Pauli Shadow Tomography

Prior state unknown→disproved

VibeMathed recorded: The Fractional Colouring Conjecture for Triply Efficient Pauli Shadow Tomography. Consult the linked registry entry for the original report and scope.

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

Bounded mass property for compact complex manifolds

Prior state unknown→disproved

Disproved on the Hopf threefold X=(C3∖{0})/⟨z↦e−1z⟩X=(\mathbb{C}^3\setminus\{0\})/\langle z\mapsto e^{-1}z\rangle: Xia and Zhang construct a smooth Hermitian form ω\omega and smooth functions φj\varphi_j with ω+ddcφj>0\omega+dd^c\varphi_j>0 whose Monge-Ampère masses tend to infinity, so the universal bounded mass property fails already in complex dimension three. The construction uses the Hopf threefold's elliptic fibration, an exact mass…

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review
probability-statisticsAug 27, 2026Significance 15/100Registry: lean checked

The Lyons–White conjecture: rate-monotonicity of ℓ2m\ell^{2m} distances for random walks on dihedral groups

Prior state unknown→proved

No such pair exists: for every positive integer mm and every nn, (Dn,2m)(D_n,2m) is rate-monotonic (Theorem A), and more generally so is every inversion extension of a finite abelian group by an involution, a family containing the generalized dihedral, dicyclic and generalized quaternion groups (Theorem B). The picture is completed in the other direction: for every real p≥1p\ge 1 that is not an even integer there is an…

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review
geometry-topologyJun 1, 2026Significance 15/100Registry: unreviewed

Darboux injections from closed manifolds: Banakh–Banakh Problems 1.7 and 1.8

Prior state unknown→proved

Both problems are answered affirmatively, in every dimension at once: every connectedness-preserving injection from a connected closed nn-manifold into an nn-manifold is a homeomorphism onto a component, so in particular every Darboux self-bijection of Sn\mathbb S^n and of every closed manifold is a homeomorphism. This removes the finite-H1H_1 hypothesis of the 2020 theorem for 3-manifolds and extends it above dim…

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

Logarithmic basis number of graphs

Prior state unknown→proved

Knauer proves that every finite nn-vertex multigraph satisfies bn(G)=O(log⁡n)\mathrm{bn}(G)=O(\log n), improving the previous general O(log⁡2n)O(\log^2 n) bound and matching the known Ω(log⁡n)\Omega(\log n) order. He also proves the sharper cycle-rank bound bn(G)=O(log⁡β(G))\mathrm{bn}(G)=O(\log\beta(G)). Combined with a reduction of Lehner and Miraftab, this yields bn(G)=O(log⁡g)\mathrm{bn}(G)=O(\log g) for graphs of Euler genus gg, improving the previous…

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

Entropy of Bernoulli Measures Conditioned on Affine Subspaces and a Problem of Ancheta-Massey

Prior state unknown→proved

For a Bernoulli(p)(p) source with 0<p<120<p<\frac12, the paper proves that the best lossy compression achievable by a linear encoder is exactly the simple time-sharing strategy that losslessly compresses a fraction of the bits and estimates the rest as zero. Equivalently, every full-row-rank H∈F2k×nH\in\mathbb F_2^{k\times n} satisfies kn≥h(p)(1−D(H)p).\frac{k}{n}\ge h(p)\left(1-\frac{D(H)}p\right). This resolves Massey's question affirma…

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review
geometry-topologySep 3, 2026Significance 15/100Registry: unreviewed

Mauri and Moraga's Question on Log Calabi-Yau Pairs with Big Boundary

disproved→disproved

VibeMathed recorded: Mauri and Moraga's Question on Log Calabi-Yau Pairs with Big Boundary. Consult the linked registry entry for the original report and scope.

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review