Open registry federation

Mathematical findings

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

All 690 unreviewed 432 lean verified 144 site confirmed 66 lean checked 33 expert verified 13 contested 2

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.

number-theoryApr 15, 2026Significance 10/100Registry: site confirmed

Erdős Problem #858

Prior state unknown→proved

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

Source authenticatedErdős Problem #858 →

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review

number-theoryJul 14, 2026Significance 10/100Registry: site confirmed

Thakur's Conjecture on Carlitz-Wieferich Primes

Prior state unknown→disproved

VibeMathed recorded: Thakur's Conjecture on Carlitz-Wieferich Primes. Consult the linked registry entry for the original report and scope.

Source authenticatedThakur's Conjecture on Carlitz-Wieferich Primes →

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review

number-theoryFeb 5, 2026Significance 10/100Registry: site confirmed

Erdős Problem #851

Prior state unknown→proved

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

Source authenticatedErdős Problem #851 →

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review

number-theoryJul 1, 2026Significance 10/100Registry: site confirmed

Erdős Problem #320

Prior state unknown→proved

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

Source authenticatedErdős Problem #320 →

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review

number-theoryApr 26, 2026Significance 10/100Registry: site confirmed

Erdős Problem #896

Prior state unknown→proved

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

Source authenticatedErdős Problem #896 →

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review

quantum-information-computingAug 27, 2026Significance 10/100Registry: site confirmed

Supporting affine functionals for Entanglement of Formation

Prior state unknown→disproved

For two qubits, the paper considers $\rho=\frac12|\Phi^+\rangle\langle\Phi^+|+\frac12|01\rangle\langle01|$ , where $|\Phi^+\rangle=(|00\rangle+|11\rangle)/\sqrt2$ . This rank-2 state has no global supporting affine functional for Entanglement of Formation. Setting $\rho_t=(1-t)\rho+t|10\rangle\langle10|$ , Wootters’ formula gives $C(\rho_t)=\frac12-\sqrt{2t}+O(t)$ . Consequently,…

Source authenticatedSupporting affine functionals for Entanglement of Formation →

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review

number-theoryApr 3, 2026Significance 10/100Registry: site confirmed

Erdős Problem #152

Prior state unknown→proved

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

Source authenticatedErdős Problem #152 →

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review

algorithms-optimizationJun 12, 2026Significance 10/100Registry: site confirmed

The Papamanthou-Tollis Conjecture on Parameterized st-Orientations

Prior state unknown→disproved

VibeMathed recorded: The Papamanthou-Tollis Conjecture on Parameterized st-Orientations. Consult the linked registry entry for the original report and scope.

Source authenticatedThe Papamanthou-Tollis Conjecture on Parameterized st-Orientations →

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review

combinatoricsApr 9, 2026Significance 10/100Registry: site confirmed

Erdős Problem #1091

Prior state unknown→proved

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

Source authenticatedErdős Problem #1091 →

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review

number-theoryApr 22, 2026Significance 10/100Registry: site confirmed

Erdős Problem #863

Prior state unknown→proved

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

Source authenticatedErdős Problem #863 →

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review

number-theoryJul 1, 2026Significance 10/100Registry: site confirmed

Erdős Problem #793

Prior state unknown→proved

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

Source authenticatedErdős Problem #793 →

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review

number-theoryNov 20, 2025Significance 10/100Registry: site confirmed

Erdős Problem #848

Prior state unknown→proved

Resolved for all sufficiently large N via a stability theorem; small N remain a finite computation (erdosproblems.com marks the problem DECIDABLE)

Source authenticatedErdős Problem #848 →

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review

number-theoryApr 25, 2026Significance 10/100Registry: site confirmed

Erdős Problem #888

Prior state unknown→proved

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

Source authenticatedErdős Problem #888 →

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review

number-theoryApr 16, 2026Significance 10/100Registry: site confirmed

Erdős Problem #1217

Prior state unknown→proved

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

Source authenticatedErdős Problem #1217 →

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review

combinatoricsJul 23, 2026Significance 10/100Registry: site confirmed

The Target-Free Clique Conjecture for Threshold-Linear Networks

Prior state unknown→disproved

VibeMathed recorded: The Target-Free Clique Conjecture for Threshold-Linear Networks. Consult the linked registry entry for the original report and scope.

Source authenticatedThe Target-Free Clique Conjecture for Threshold-Linear Networks →

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review

number-theoryApr 19, 2026Significance 10/100Registry: site confirmed

Erdős Problem #1195

Prior state unknown→proved

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

Source authenticatedErdős Problem #1195 →

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review

geometry-topologyFeb 1, 2026Significance 10/100Registry: site confirmed

Erdős Problem #1089

Prior state unknown→proved

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

Source authenticatedErdős Problem #1089 →

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review

number-theoryJun 21, 2026Significance 10/100Registry: site confirmed

Erdős Problem #948

Prior state unknown→proved

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

Source authenticatedErdős Problem #948 →

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review

combinatoricsApr 21, 2026Significance 10/100Registry: site confirmed

Erdős Problem #603

Prior state unknown→proved

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

Source authenticatedErdős Problem #603 →

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review

number-theoryApr 6, 2026Significance 10/100Registry: site confirmed

Erdős Problem #26

Prior state unknown→disproved

The question as posed was implicit in Davenport–Erdős (1951); the AI result settles Tenenbaum's open variant negatively

Source authenticatedErdős Problem #26 →

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review

combinatoricsJul 18, 2026Significance 9/100Registry: site confirmed

Kaul-Mudrock Conjecture on the Unlabeled List Color Function

Prior state unknown→proved

VibeMathed recorded: Kaul-Mudrock Conjecture on the Unlabeled List Color Function. Consult the linked registry entry for the original report and scope.

Source authenticatedKaul-Mudrock Conjecture on the Unlabeled List Color Function →

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review

combinatoricsSep 6, 2026Significance 8/100Registry: site confirmed

Optimality of the added-vector code in the 19-dimensional kissing construction

Prior state unknown→proved

The manuscript proves the upper bound $|A|\le1280$ for every admissible subset of the fixed ambient code $D$ . Together with Ho’s existing construction, this determines the exact maximum. The proof partitions $D$ into 256 cosets of a 16-word subspace whose induced forbidden-distance graph is the Clebsch graph; each coset contributes at most five words. This does not determine the unrestricted kissing number…

Source authenticatedOptimality of the added-vector code in the 19-dimensional kissing construction →

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=1$ : every non-real first-quadrant zero of $\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\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…

Source authenticatedHaglund's Zero-Trajectory Conjecture for the First Riemann Xi Approximant →

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 \ge 4$ and $b \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)$ for all $a \ge 3$ ; the conjecture's trivial a = 1, 2 cases are unaddressed by either entry, and the cyclic analogue $R_{cyc}(P_a^{alt}, K_b)$ for $a \ge 4$ remains open. The engin…

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

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 = 51$ an integer vector $x$ satisfies $x^{T}Ax > 11\,x^{T}x$ , so $\lambda_1 > 11 = D$ . The deficit $\lambda_1(n) - D(n)$ grows through $n = 5000$ in the repository's computations, but no asymptotic theorem proving divergence is claimed, so "false for every constant $C$ " is a computed pattern, not a proved one. One anomaly, which the…

Source authenticatedGraffiti Conjecture 806 →

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review

combinatoricsAug 13, 2026Significance 5/100Registry: site confirmed

Nineteen exact reflective and dihedral Ramsey numbers from Damnjanovic-Dordevic's tables

Prior state unknown→proved

Nineteen individual exact values, each decided by SAT certificate: unsatisfiable at the claimed $n$ , witnessed satisfiable at $n-1$ . They close cells in DD26's Tables 3-13 but settle no infinite family - the sibling entries do that for the $K$ column. The three overlap cells are $R_{dih}(P_4^{alt},K_6)=16$ , $R_{dih}(P_3^{alt},K_9)=17$ and $R_{dih}(P_9^{alt},K_3)=17$ , each an instance of a sibling theorem; the remain…

Source authenticatedNineteen exact reflective and dihedral Ramsey numbers from Damnjanovic-Dordevic's tables →

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review

combinatoricsAug 12, 2026Significance 5/100Registry: site confirmed

Dihedral and cyclic Ramsey numbers of the alternating 3-path

Prior state unknown→proved

The a = 3 slice is settled outright. The parent conjecture's dihedral side has since been resolved for every a >= 4 as well (see the related entry), so Conjecture 4.9's claim 1 + (a-1)(b-1) now stands proved for all a >= 3; the trivial a = 1, 2 cases and the cyclic analogue for a >= 4 remain formally unaddressed.

Source authenticatedDihedral and cyclic Ramsey numbers of the alternating 3-path →

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review

combinatoricsJul 23, 2026Significance 5/100Registry: site confirmed

WOWII Conjecture 72: Two induced trees pin down tree( $G$ )

Prior state unknown→proved

The evenly-divided reading of WOWII Conjecture 72 holds: $\lceil(A + L)/3\rceil \le t,$ where $t =$ tree( $G$ ) (order of a largest induced tree), $A =$ average eccentricity and $L =$ maximum neighbourhood independence number. A stronger reading that divides only $L$ by three is false. The argument rests on two elementary observations (a diametral path is chordless and therefore induces a tre…

Source authenticatedWOWII Conjecture 72: Two induced trees pin down tree(

G

) →

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review

combinatoricsAug 26, 2026Significance 4/100Registry: site confirmed

An Exact All-Width Plateau for the Three-Summand Tu-Deng Count modulo $2^k-1$

Prior state unknown→proved

Answered in full: for every $k\ge4$ , a target with exactly two nonadjacent zero digits has $F_k(t)=(k+23)3^{k-4}$ , independently of the distance between the zeros. Exact at every width, no error term, no hypothesis on $k$ (Theorem 1.1). This is an evaluation, not an extremal result, and the paper is explicit about the difference: the plateau value is not maximal. At $k=12$ it reads $35\cdot3^8=229{,}635$ while…

Source authenticatedAn Exact All-Width Plateau for the Three-Summand Tu-Deng Count modulo

2^k-1

→

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review

analysisAug 14, 2026Significance 4/100Registry: site confirmed

Lorist-Schwenninger Remark 2 positivity question

Prior state unknown→disproved

Nothing in the paper's proof is affected. At the witness, inequality (4) holds with slack +27.0, inequality (5) holds with equality (f is inner), and the theorem itself holds with slack 2 - kappa = +0.80. Only the shortcut Remark 2 floats is refuted.

Source authenticatedLorist-Schwenninger Remark 2 positivity question →

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review