Open registry federation
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.
The footnote is worth reading on its own: an author saying in print that the model earned coauthorship and that policy is what prevents it.
resolved under an explicit formalization of 'reasonable', not in full generality
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
VibeMathed recorded: Levit–Mandrescu Unimodality Conjecture. Consult the linked registry entry for the original report and scope.
VibeMathed recorded: Complexity of Terminal-Only Manhattan Prim-Dijkstra Routing. Consult the linked registry entry for the original report and scope.
VibeMathed recorded: Minimax Rate for Density Estimation under Wasserstein Contamination. Consult the linked registry entry for the original report and scope.
VibeMathed recorded: Avidor-Zwick Question on Low-Dimensional Max-Cut SDP. Consult the linked registry entry for the original report and scope.
VibeMathed recorded: Vertex-Minimal Paper Tori. Consult the linked registry entry for the original report and scope.
VibeMathed recorded: Chafai-Dadoun-Youssef Questions on Logarithmic Energy Monotonicity. Consult the linked registry entry for the original report and scope.
Two independent affirmative claims (Adriano's, posted first, and a GPT-5.5 Pro note); Erdős himself wrote in 1982 that the problem had been solved affirmatively long before, without a locatable reference
A record, not an endpoint: whether fewer vertices suffice is posed as an open question in the same paper.
Improves the exponent rather than answering the asked question: whether an colouring exists remains open.
VibeMathed recorded: Sharp Continuity Bound for Quantum Conditional Entropy. Consult the linked registry entry for the original report and scope.
VibeMathed recorded: Binary Digits of the Erdős-Borwein Constant. Consult the linked registry entry for the original report and scope.
VibeMathed recorded: Optimal Online Discrepancy in Linear Time. Consult the linked registry entry for the original report and scope.
the odd-cycle half; the even-cycle half is a companion paper by the same authors
VibeMathed recorded: Ji-Zhang Question on the Power Set of a Quasinilpotent Operator. Consult the linked registry entry for the original report and scope.
VibeMathed recorded: Zhang's Question on Howson and Strongly Howson Groups. Consult the linked registry entry for the original report and scope.
Resolved the sharp constant (w.h.p.) for random graphs G(n, d/n)
VibeMathed recorded: Tarizadeh's Conjecture on the Maximality of Purely-Prime Ideals. Consult the linked registry entry for the original report and scope.
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.
The claim is for every , reduced to three finite facts: the base value , and the unsatisfiability of a 321-position and a 521-position spoke template. The reduction is Lean-checked and holds for every ; 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…
VibeMathed recorded: Uniform Witnesses for Uniform Set Systems: the k=3 Question. Consult the linked registry entry for the original report and scope.
VibeMathed recorded: Conjecture 3 of the Dynamical Sampling Survey. Consult the linked registry entry for the original report and scope.
VibeMathed recorded: Nazarov's Conjecture on Truncations for Fractional Laplacians. Consult the linked registry entry for the original report and scope.
Four results, and the first is partly a refutation. Jakimiuk conjectured is optimal for every ; the paper proves that for and gives a counterexample for every , so the conjecture is false as posed and the corrected range is . The witness is the two-coordinate vector . The Baranski-Murawski-Nayar-Oleszkiewicz flat-po…
VibeMathed recorded: Pavez-Signe's Length-Control Question for Spanning Subdivisions. Consult the linked registry entry for the original report and scope.
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…
VibeMathed recorded: Curto et al.'s Minimality Conjecture for Threshold-Linear Networks. Consult the linked registry entry for the original report and scope.
Near-optimal rather than optimal: the bounds match up to logarithmic-type factors.
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.
We prove . One lower-bound proof uses two explicit block-disjoint 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…
We prove using an explicit -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 constructions…
We prove . 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…
The exact value is . The lower bound uses explicit legal twin-player rules over . 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…
VibeMathed recorded: Twelve Common Flex Lines in a General Pencil of Cubics. Consult the linked registry entry for the original report and scope.