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.

differential-equationsOct 26, 2025Significance 8/100Registry: unreviewed

Curto et al.'s Minimality Conjecture for Threshold-Linear Networks

Prior state unknown→disproved

VibeMathed recorded: Curto et al.'s Minimality Conjecture for Threshold-Linear Networks. Consult the linked registry entry for the original report and scope.

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review
number-theoryAug 22, 2026Significance 8/100Registry: site confirmed

Haglund's Zero-Trajectory Conjecture for the First Riemann Xi Approximant

Prior state unknown→proved

Proves Haglund's Conjecture 4 for k=1k=1: every non-real first-quadrant zero of Φ1+tΦ2\Phi_1+t\Phi_2 is simple with strictly decreasing imaginary part, no branch escapes forward, and every finite-multiplicity real collision stays real afterwards. The cases k≥2k\ge2 remain open. Two readings worth separating: Conjecture 4 asserts the monotone descent alone, so the no-escape and stays-real statements are this paper's own ad…

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review
combinatoricsApr 30, 2026Significance 8/100Registry: unreviewed

Garamvölgyi-Jackson-Jordán Conjecture on Cliques in Minimally Globally Rigid Graphs

Prior state unknown→proved

VibeMathed recorded: Garamvölgyi-Jackson-Jordán Conjecture on Cliques in Minimally Globally Rigid Graphs. Consult the linked registry entry for the original report and scope.

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

Fourth-moment conjectures for Rademacher sums

Prior state unknown→proved

Four results, and the first is partly a refutation. Jakimiuk conjectured cp=μp−1c_p = \mu_p - 1 is optimal for every p≥3p \ge 3; the paper proves that for p≥4p \ge 4 and gives a counterexample for every 2<p<42 < p < 4, so the conjecture is false as posed and the corrected range is p≥4p \ge 4. The witness is the two-coordinate vector S2=(ε1+ε2)/2S_2 = (\varepsilon_1+\varepsilon_2)/\sqrt2. The Baranski-Murawski-Nayar-Oleszkiewicz flat-po…

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

Pavez-Signe's Length-Control Question for Spanning Subdivisions

Prior state unknown→proved

VibeMathed recorded: Pavez-Signe's Length-Control Question for Spanning Subdivisions. Consult the linked registry entry for the original report and scope.

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review
algebraAug 14, 2026Significance 8/100Registry: unreviewed

Tarizadeh's Conjecture on the Maximality of Purely-Prime Ideals

Prior state unknown→disproved

VibeMathed recorded: Tarizadeh's Conjecture on the Maximality of Purely-Prime Ideals. Consult the linked registry entry for the original report and scope.

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

The 4-color Rado number of x+y+c=z: general case

Prior state unknown→proved

The claim is R(c)=40c+41R(c) = 40c+41 for every c≥2c \ge 2, reduced to three finite facts: the base value R(2)=121R(2) = 121, and the unsatisfiability of a 321-position and a 521-position spoke template. The reduction is Lean-checked and holds for every D≥1D \ge 1; the two unsatisfiability results carry DRAT proofs. This completes the partial entry for the same conjecture, which proved it for roughly two thirds of integers via a sc…

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

Predicting Diagonalizability of a Mean Matrix

Prior state unknown→proved

The general principle is the interesting part: every semialgebraic property of a bounded fixed-dimensional mean parameter is eventually almost surely predictable. Against merely integrable matrix laws it fails from dimension two.

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review
mathematical-physicsAug 9, 2026Significance 8/100Registry: lean checked

Matrix-Tree Obstruction for Half-Collinear Graviton Vertices

Prior state unknown→proved

Answers the obstruction rather than the whole question: it says exactly when the Matrix-Tree Theorem can be applied and classifies the chambers, and gives a compact five-graviton formula outside the decay region. Simplifying the general solution, which is what the source paper left to future work, remains open.

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

Dihedral Ramsey numbers of the alternating a-path versus K_b, for every a >= 4: 1 + (a-1)(b-1)

Prior state unknown→proved

The dihedral case only, for every a≥4a \ge 4 and b≥1b \ge 1; the substance is the upper bound, which the source paper's own computations could not reach. Together with the sibling a = 3 entry this proves Conjecture 4.9's claim 1+(a−1)(b−1)1+(a-1)(b-1) for all a≥3a \ge 3; the conjecture's trivial a = 1, 2 cases are unaddressed by either entry, and the cyclic analogue Rcyc(Paalt,Kb)R_{cyc}(P_a^{alt}, K_b) for a≥4a \ge 4 remains open. The engin…

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

The 4-Color Rado Number of x+y+c=zx+y+c=z: R(c)=40c+41R(c)=40c+41 Whenever c+1c+1 Is Divisible by 3, 4, 5 or 7

Prior state unknown→proved

Twenty-eight individual exact values, each proved by SAT certificate (coloring at n-1, UNSAT at n). The synthesis theorem covers every c >= 2 whose c+1 is divisible by 3, 4, 5, or 7 (~66% of integers). The prime-reduction corollary shows the full conjecture (R(c)=40c+41 for all c >= 2) is equivalent to checking primes p >= 89; all primes through 83 are settled. What stays open: the conjecture at c=88 (p=89) and ever…

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review
combinatoricsSep 4, 2026Significance 7/100Registry: unreviewed

The proper hat-guessing number of K8−eK_8-e

Prior state unknown→proved

We prove HGP(K8−e)=14\mathrm{HG}_P(K_8-e)=14 using an explicit PGL(2,13)\mathrm{PGL}(2,13)-equivariant strategy. A compact formula fixes 990 normalized twin decisions, and a 48,510-edge residual-orbit matching induces consistent rules on 53,460 labelled clique-view orbits. Independent implementations regenerate the certificate and check all 138,378,240 proper fourteen-colourings with zero failures. Unlike the n=5,6,7n=5,6,7 constructions…

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review
combinatoricsSep 3, 2026Significance 7/100Registry: unreviewed

The proper hat-guessing number of K7−eK_7-e

Prior state unknown→proved

We prove HGP(K7−e)=12\mathrm{HG}_P(K_7-e)=12. One lower-bound proof uses two explicit block-disjoint S(5,6,12)S(5,6,12) Witt designs. A second uses orbit maps from an explicitly regenerated sharply five-transitive twelve-point permutation group, combining one set-symmetric and one order-sensitive rule. Both satisfy a general coordinate-line twin-completion criterion, and Hall's theorem completes the clique strategy. The release also…

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review
combinatoricsSep 3, 2026Significance 7/100Registry: unreviewed

The proper hat-guessing number of K6−eK_6-e

Prior state unknown→proved

We prove HGP(K6−e)=10\mathrm{HG}_P(K_6-e)=10. The lower bound uses two order-sensitive twin-player rules obtained by deleting and repairing one point of an explicit sharply four-transitive eleven-point permutation group. On every coordinate line the repaired rules are derangement permutations, are pointwise unequal, and have fixed-point-free composition. Hall's theorem completes the strategy on the four clique vertices. The r…

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

The proper hat-guessing number of K5−eK_5-e

Prior state unknown→proved

The exact value is HGP(K5−e)=8\mathrm{HG}_P(K_5-e)=8. The lower bound uses explicit legal twin-player rules over F23\mathbb F_2^3. After those rules cover 3,024 of the 8,400 proper colorings, the residual-coloring/local-view incidence graph has left degree three and right degree at most three; Hall's theorem supplies consistent guesses for the three clique players. The release also proves a general sufficient twin-completion…

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review
mathematical-physicsJun 8, 2026Significance 7/100Registry: unreviewed

Free Fermions in Disguise without Exponential Degeneracies

Prior state unknown→proved

An existence question settled by exhibiting an object, not a general theorem: one model in the family has no exponential degeneracies for generic couplings, and nothing here says which others do. The route is worth recording because it is not the one anyone was looking down. The author had tried and failed to find such a model directly. It surfaced instead from an unrelated classification of medium-range spin chain…

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review
algorithms-optimizationJun 18, 2026Significance 7/100Registry: lean checked

The Ramachandra-Natarajan Pairwise Independent Correlation Gap Conjecture

Prior state unknown→disproved

VibeMathed recorded: The Ramachandra-Natarajan Pairwise Independent Correlation Gap Conjecture. Consult the linked registry entry for the original report and scope.

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

Signed Depth Relevance of subDL

Prior state unknown→proved

subDL satisfies the signed depth relevance property, answering an open question posed by Øgaard (2026). More precisely, every valid inference in subDL contains a propositional variable that occurs in both the premises and conclusion with matching sign and at matching implicational depth.

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

Minimum Edge-Outerplanar Embedding

Prior state unknown→proved

VibeMathed recorded: Minimum Edge-Outerplanar Embedding. Consult the linked registry entry for the original report and scope.

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review
quantum-information-computingSep 2, 2026Significance 6/100Registry: unreviewed

Depth-1 distinctness for pseudorandom unitaries

Prior state unknown→disproved

The paper proves that a tensor-product ensemble of independently chosen single-qubit Clifford gates is negl⁡(n)\operatorname{negl}(n)-distinct when the number of queries is polynomial in nn. This disproves the authors' conjecture that negligibly distinct ensembles must necessarily be entangling. As an application, the depth-log⁡n\log n global Clifford/unitary-22-design layer used in the PFCPFC pseudorandom-unitary construct…

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review
number-theorySep 30, 2025Significance 6/100Registry: unreviewed

Cohen's 22 Conjectures on Cyclic Numbers

Prior state unknown→proved

VibeMathed recorded: Cohen's 22 Conjectures on Cyclic Numbers. Consult the linked registry entry for the original report and scope.

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

Sombor-Energy Conjecture

Prior state unknown→disproved

VibeMathed recorded: Sombor-Energy Conjecture. Consult the linked registry entry for the original report and scope.

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

Graffiti Conjecture 806

Prior state unknown→disproved

The repository supplies an executable verifier in exact integer arithmetic; for n=51n = 51 an integer vector xx satisfies xTAx>11 xTxx^{T}Ax > 11\,x^{T}x, so λ1>11=D\lambda_1 > 11 = D. The deficit λ1(n)−D(n)\lambda_1(n) - D(n) grows through n=5000n = 5000 in the repository's computations, but no asymptotic theorem proving divergence is claimed, so "false for every constant CC" is a computed pattern, not a proved one. One anomaly, which the…

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

Graffiti Conjecture 6

Prior state unknown→disproved

Infinite family of counterexamples; mathematical argument internally checked, with external verification and novelty review pending.

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

Elizalde-Luo Pattern-Avoidance Conjecture

Prior state unknown→proved

VibeMathed recorded: Elizalde-Luo Pattern-Avoidance Conjecture. Consult the linked registry entry for the original report and scope.

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review