Open registry federation

Mathematical findings

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

Imported from VibeMathed under CC BY 4.0. Each record links to its registry entry and named primary source. Registry verification is preserved verbatim.

number-theoryJun 1, 2026Significance 10/100Registry: unreviewed

Erdős Problem #477

Prior state unknownproved

Does there exist an integer polynomial ff of degree at least two and a set AZA \subseteq \mathbb{Z} such that every integer has a unique representation n=a+f(k)n = a + f(k)? A manuscript claims the thirteenth powers admit a tiling complement.

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

Erdős Problem #863

Prior state unknownproved

VibeMathed records this result as “Erdős Problem #863.” The registry entry and named primary source contain the available statement and scope.

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

First Proof Question 8: Smoothing Polyhedral Lagrangians

Prior state unknownproved

Question 8 of the First Proof experiment (Abouzaid et al.) asks whether a polyhedral Lagrangian surface with exactly four faces meeting at every vertex necessarily admits a Lagrangian smoothing. The research report assembles ChatGPT-suggested constructions into an affirmative argument for orientable surfaces in (R4,ω)(\mathbb{R}^4, \omega): smooth the edges, verify the vertex links are unknots with rot 0 and tb -1, and…

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review
number-theoryJul 21, 2026Significance 10/100Registry: lean verified

Erdős Problem #469

Prior state unknownproved

Does the sum of the reciprocals of all primitive pseudoperfect numbers converge?

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review
analysisApr 9, 2026Significance 10/100Registry: lean verified

Erdős Problem #990

Prior state unknowndisproved

VibeMathed records this result as “Erdős Problem #990.” The registry entry and named primary source contain the available statement and scope.

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review
combinatoricsApr 16, 2026Significance 10/100Registry: lean checked

Erdős Problem #670: Diameter with Separated Distances

Prior state unknowndisproved

Erdős asked whether every nn-point set in Euclidean space whose pairwise distances are mutually at least 1 apart must have diameter at least (1+o(1))n2(1+o(1))n^2. Disproved: an explicit high-dimensional construction beats the conjectured constant.

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

Erdős Problem #1177

Prior state unknownproved

For a finite forbidden triple system GG, what exact uncountable chromatic cardinalities occur among GG-free triple systems, and how do those spectra interact? The revised manuscript answers the three exact-cardinal questions and claims a complete spectrum dichotomy.

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review
geometry-topologyFeb 3, 2026Significance 10/100Registry: lean checked

Chen-Gendron Spin-Parity Identity for k-Differentials

Prior state unknownproved

For odd kk with gcd(n,k)=gcd(n+1,k)=1\gcd(n,k) = \gcd(n+1,k) = 1, is Nk(n)(k+1)/4(mod2)N_k(n) \equiv \lfloor (k+1)/4 \rfloor \pmod 2, where Nk(n)N_k(n) counts pairs 1bi(k1)/21 \le b_i \le (k-1)/2 with b1+b2(k+1)/2b_1 + b_2 \ge (k+1)/2 and b2nb1(modk)b_2 \equiv n b_1 \pmod k? Conjectured by Chen and Gendron; its proof removes a conditional step in the genus-zero and genus-one spin-parity classification.

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review
number-theoryMay 1, 2026Significance 10/100Registry: lean verified

Erdős Problem #694

Prior state unknownproved

VibeMathed records this result as “Erdős Problem #694.” The registry entry and named primary source contain the available statement and scope.

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review
number-theoryJul 13, 2026Significance 10/100Registry: lean verified

Erdős Problem #450

Prior state unknownproved

How large must y(ε,n)y(\varepsilon, n) be so that every interval (x,x+y)(x, x+y) contains at most εy\varepsilon y integers having a divisor in (n,2n)(n, 2n)? The candidate proof gives the sharp fixed-ε\varepsilon order y=Θε(n)y = \Theta_\varepsilon(n), uniformly in the translate.

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review
number-theoryApr 9, 2026Significance 10/100Registry: lean verified

Erdős Problem #1141

Prior state unknowndisproved

VibeMathed records this result as “Erdős Problem #1141.” The registry entry and named primary source contain the available statement and scope.

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

Erdős Problem #539

Prior state unknownproved

main exponent determined; sharper subpolynomial factors remain open

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review
number-theoryJan 11, 2026Significance 10/100Registry: lean verified

Erdős Problem #401

Prior state unknownproved

VibeMathed records this result as “Erdős Problem #401.” The registry entry and named primary source contain the available statement and scope.

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

Strong Log-Concavity of Chernoff's Density

Prior state unknownproved

Is the density of Chernoff's distribution - the law of argmaxt{W(t)t2}\operatorname{argmax}_t \{W(t) - t^2\} for two-sided Brownian motion WW - strongly log-concave, as conjectured by Balabdaoui and Wellner in 2014?

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review
combinatoricsApr 9, 2026Significance 10/100Registry: site confirmed

Erdős Problem #1091

Prior state unknownproved

VibeMathed records this result as “Erdős Problem #1091.” The registry entry and named primary source contain the available statement and scope.

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review
geometry-topologyJul 13, 2026Significance 10/100Registry: lean verified

Erdős Problem #130

Prior state unknownproved

the infinite-chromatic subquestion is proved; the rest of the problem remains open

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review
number-theoryJul 14, 2026Significance 10/100Registry: site confirmed

Thakur's Conjecture on Carlitz-Wieferich Primes

Prior state unknowndisproved

A monic prime PP of Fq[T]\mathbb{F}_q[T] is a cc-Wieferich prime if ρP(1)1modP2\rho_P(1) \equiv 1 \bmod P^2 for the Carlitz module ρ\rho. On limited data and proofs in degrees 22 and 33, Thakur suggested in 2015 that in odd characteristic every cc-Wieferich prime has degree divisible by pp. It is false: an explicit irreducible cc-Wieferich prime has degree not divisible by pp, and the resulting common factor has a clos…

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review
geometry-topologyFeb 1, 2026Significance 10/100Registry: expert verified

Erdős Problem #654

Prior state unknowndisproved

the strongest form is disproved via configurations where every point sees at most about 3n/4 distinct distances; the weaker improvement remains open

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review
combinatoricsApr 23, 2026Significance 10/100Registry: lean verified

Erdős Problem #1014

Prior state unknownproved

VibeMathed records this result as “Erdős Problem #1014.” The registry entry and named primary source contain the available statement and scope.

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

Zhi-Wei Sun's Conjecture 3.4 on a Truncated Legendre-Symbol Determinant

Prior state unknownproved

Zhi-Wei Sun conjectured a closed evaluation of a truncated Legendre-symbol determinant. For every prime p3(mod4)p \equiv 3 \pmod 4 it equals (p2)/32x\lfloor (p-2)/3 \rfloor^2 x, proved by reducing to inverse data for Chapman's full Legendre-symbol matrix and evaluating that with Vsemirnov's factorization and a Schur-Pfaffian resolvent identity.

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

Erdős Problem #996

Prior state unknowndisproved

Answered negatively in a preprint that also settles the p=2 case of problem #995; erdosproblems.com still lists the problem open

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review
geometry-topologyFeb 1, 2026Significance 10/100Registry: site confirmed

Erdős Problem #1089

Prior state unknownproved

VibeMathed records this result as “Erdős Problem #1089.” The registry entry and named primary source contain the available statement and scope.

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review
quantum-information-computingJul 27, 2026Significance 10/100Registry: unreviewed

Sharp Continuity Bound for Quantum Conditional Entropy

Prior state unknownproved

What is the optimal uniform continuity bound for quantum conditional entropy in trace distance, depending only on the dimension of the conditioned system? The sharp bound h2(δ)+δlog(d21)h_2(\delta) + \delta \log(d^2 - 1) up to δ=1d2\delta = 1 - d^{-2}, conjectured by Wilde, is proved.

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review
geometry-topologyJul 13, 2026Significance 10/100Registry: lean verified

Erdős Problem #769

Prior state unknowndisproved

the conjectured lower bound is disproved; good bounds for c(n) remain open

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

Type-D ASEP Tracy-Widom Marginals

Prior state unknownproved

Do the one-species current marginals of type-D ASEP have the predicted Tracy-Widom long-time asymptotics despite the model's two-species interactions?

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review
number-theoryJul 25, 2026Significance 10/100Registry: lean verified

Erdős Problem #768

Prior state unknownproved

If A(x)A(x) counts integers satisfying the Sylow divisor condition, determine the constant cc in A(x)/x=exp((c+o(1))logxloglogx)A(x)/x = \exp(-(c + o(1)) \sqrt{\log x} \log\log x). The claimed exact value is c=1/(2log2)c = 1/(2\sqrt{\log 2}).

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review
number-theoryApr 25, 2026Significance 10/100Registry: lean verified

Erdős Problem #1138

Prior state unknowndisproved

VibeMathed records this result as “Erdős Problem #1138.” The registry entry and named primary source contain the available statement and scope.

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

The Schwartz Quadratic Meander Number Conjecture

Prior state unknownproved

A cyclic meander induces a cyclic permutation on its 2n2n marked intersection points. Schwartz's conjecture on the quadratic growth of the associated meander number is resolved.

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review
number-theoryJul 8, 2026Significance 10/100Registry: lean verified

Erdős Problem #866

Prior state unknownproved

h₄(n) = 4 for every n ≥ 331,777, with improved global bounds; the broader problem remains open

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review
number-theoryJul 24, 2026Significance 10/100Registry: lean verified

Erdős Problem #131

Prior state unknownproved

The new content is the upper bound; the matching N^(1/5) construction is prior work of Erdős and Csaba. erdosproblems.com has not accepted the claim

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review
number-theoryJun 5, 2026Significance 10/100Registry: lean verified

Erdős Problem #696

Prior state unknownproved

VibeMathed records this result as “Erdős Problem #696.” The registry entry and named primary source contain the available statement and scope.

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review
number-theoryJul 1, 2026Significance 10/100Registry: site confirmed

Erdős Problem #793

Prior state unknownproved

Let F(n)F(n) be the largest A{1,,n}A\subseteq\{1,\dots,n\} with abca\nmid bc for distinct a,b,cAa,b,c\in A. Is F(n)=π(n)+(C+o(1))n2/3(logn)2F(n)=\pi(n)+(C+o(1))\,n^{2/3}(\log n)^{-2} for some constant CC?

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

Erdős Problem #856

Prior state unknownproved

Identifies the exponent as a variational sunflower-capacity constant, sharpening the Tang-Zhang bounds; the value of that constant itself remains open, as does site acceptance

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review
combinatoricsMay 3, 2026Significance 10/100Registry: lean verified

Erdős Problem #750

Prior state unknownproved

VibeMathed records this result as “Erdős Problem #750.” The registry entry and named primary source contain the available statement and scope.

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review