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.

combinatoricsFeb 17, 2026Significance 12/100Registry: unreviewed

The Leading Constant for Large-Order Davenport-Schinzel Sequences

Prior state unknown→proved

VibeMathed recorded: The Leading Constant for Large-Order Davenport-Schinzel Sequences. Consult the linked registry entry for the original report and scope.

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

Log-Submodularity of Zonoid Volume

Prior state unknown→disproved

The paper also proves the conjecture in the unimodular case and characterizes equality there, so the boundary between true and false is drawn rather than just crossed.

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

Ghasemi-Kopparty Problem on Sparse SS-Decoding Polynomials

Prior state unknown→proved

the PIR consequence is conditional on a number-theoretic conjecture implied by either the generalized repunit conjecture or Schinzel's hypothesis H, and is unconditional for s <= 15

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

Equality in Fill's Spectral Gap Problem

Prior state unknown→proved

VibeMathed recorded: Equality in Fill's Spectral Gap Problem. Consult the linked registry entry for the original report and scope.

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review
theoretical-computer-scienceJul 10, 2026Significance 12/100Registry: unreviewed

Klopp-Zadik Question on Polynomial-Time Node-Private Recovery

Prior state unknown→proved

VibeMathed recorded: Klopp-Zadik Question on Polynomial-Time Node-Private Recovery. Consult the linked registry entry for the original report and scope.

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

The Second Computational Chomp Challenge of Ekhad and Zeilberger

Prior state unknown→proved

VibeMathed recorded: The Second Computational Chomp Challenge of Ekhad and Zeilberger. Consult the linked registry entry for the original report and scope.

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review
algorithms-optimizationApr 7, 2026Significance 12/100Registry: unreviewed

Thiele Rules on the Voter Interval Domain

Prior state unknown→proved

VibeMathed recorded: Thiele Rules on the Voter Interval Domain. Consult the linked registry entry for the original report and scope.

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

Neuen-Grohe Problem: Isomorphism of Tournaments with Bounded VC Dimension

Prior state unknown→proved

VibeMathed recorded: Neuen-Grohe Problem: Isomorphism of Tournaments with Bounded VC Dimension. Consult the linked registry entry for the original report and scope.

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review
number-theoryAug 22, 2026Significance 12/100Registry: unreviewed

Transcendence in the affine case of Erdős Problem 270

Prior state unknown→proved

The manuscript claims Ca,bC_{a,b} is transcendental for every a≥1a\ge1 and b≥1−ab\ge1-a, settling the positive integer-valued affine subclass of Erdős Problem 270. Two pieces of context matter. Problem 270 as Erdős and Graham posed it, for every f(n)→∞f(n)\to\infty, was already answered no by Crmarić and Kovač in 2025: for any α>0\alpha>0 some such ff makes the series sum to α\alpha. What survives is the non-decreasing case,…

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

The (2,1)(2,1)-Gapped Consecutive-Ones Property Problem is NP-complete

Prior state unknown→proved

The manuscript claims a polynomial-time reduction from 3-SAT proving (2,1)(2,1)-C1P NP-hard; together with membership in NP, this establishes NP-completeness and closes the sole unresolved (k,δ)(k,\delta) case from the earlier classification. It also implies NP-completeness of the equivalent completion problem. The proof package further shows that, within its specific nested-prefix/internal-local gadget architecture, no…

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review
combinatoricsJul 31, 2026Significance 11/100Registry: unreviewed

The Integer Domination Root Conjecture

Prior state unknown→disproved

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

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review
combinatoricsApr 22, 2026Significance 10/100Registry: unreviewed

Parity obstruction in the minimum-determinant problem for Latin squares

Prior state unknown→proved

For even nn, let q(L)=det⁡(L)/bnq(L)=\det(L)/b_n. The work proves that q(L)q(L) is even exactly when the stronger centered divisibility n2∣det⁡(Estd)n^2\mid\det(E_{\mathrm{std}}) holds. For n≡2(mod4)n\equiv2\pmod4, this is equivalent to rank⁡F2(A mod 2)<n−1\operatorname{rank}_{\mathbb F_2}(A\bmod2)<n-1; for n≡0(mod4)n\equiv0\pmod4, it is equivalent to adj⁡(A mod 2)1=0\operatorname{adj}(A\bmod2)\mathbf1=0. An explicit family gives odd q(L)q(L) for every n≡2(mod4)n\equiv2\pmod4, n≥6n\ge6. This rem…

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

Strong Log-Concavity of Chernoff's Density

Prior state unknown→proved

VibeMathed recorded: Strong Log-Concavity of Chernoff's Density. Consult the linked registry entry for the original report and scope.

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review
combinatoricsJun 22, 2026Significance 10/100Registry: unreviewed

Erdős Problem #550

Prior state unknown→proved

Claimed proved in a preprint of E. Li; erdosproblems.com still lists the problem open pending human review

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review
number-theoryJun 24, 2026Significance 10/100Registry: unreviewed

Erdős Problem #1061

Prior state unknown→disproved

VibeMathed recorded: Erdős Problem #1061. Consult the linked registry entry for the original report and scope.

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review
analysisApr 29, 2026Significance 10/100Registry: unreviewed

Erdős Problem #1133

Prior state unknown→proved

VibeMathed recorded: Erdős Problem #1133. Consult the linked registry entry for the original report and scope.

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review
theoretical-computer-scienceJul 23, 2026Significance 10/100Registry: unreviewed

Dual Sequential Fat-Shattering and Tight Threshold Extraction

Prior state unknown→proved

VibeMathed recorded: Dual Sequential Fat-Shattering and Tight Threshold Extraction. Consult the linked registry entry for the original report and scope.

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review
number-theoryJun 18, 2026Significance 10/100Registry: unreviewed

Erdős Problem #451

Prior state unknown→proved

the conjectured superpolynomial growth is established; the sharper order remains open

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review
analysisApr 1, 2026Significance 10/100Registry: unreviewed

Erdős Problem #514

Prior state unknown→proved

an escape path dominating every power of |z| with bounded initial length is constructed, and universal positive-power lower bounds are ruled out; the broader variant remains open

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

The Imbalance Conjecture

Prior state unknown→proved

The key step is a lower bound on the truncated imbalance sum, which yields every Erdos-Gallai inequality for the sorted imbalance list; a parity computation finishes it.

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

Sabok's S-Prime Simplex Questions

Prior state unknown→disproved

VibeMathed recorded: Sabok's S-Prime Simplex Questions. Consult the linked registry entry for the original report and scope.

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review
analysisJul 1, 2026Significance 10/100Registry: unreviewed

Erdős Problem #1038

Prior state unknown→proved

VibeMathed recorded: Erdős Problem #1038. Consult the linked registry entry for the original report and scope.

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

Type-D ASEP Tracy-Widom Marginals

Prior state unknown→proved

VibeMathed recorded: Type-D ASEP Tracy-Widom Marginals. Consult the linked registry entry for the original report and scope.

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review