Signature of Connected Line Graphs
no constant-bound repair of the conjecture is possible
Open registry federation
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.
no constant-bound repair of the conjecture is possible
VibeMathed recorded: Sivaraman's Perfect-Divisibility Characterization Question. Consult the linked registry entry for the original report and scope.
Agulnick and Busick-Warner exhibited a family of fifth-order ambiguities on the exact unit support and conjectured that it was not a complete classification because it did not use the full field . This work proves the complete classification. The larger field enlarges the common amplitude , while every relative ambiguity remains a norm-one parameter in . Th…
Finite-jet theorems about compiled truncated EMD equation certificates: the exact shear-orbit fiber classification of the complete first seed channels, an explicit collision family with one metric three-jet realized by an actual cubic metric germ (genuine Frechet Ricci value and first derivative), the compiled impossibility theorem, and the fourth-order recovery with equality fiber . Not settled here: promo…
VibeMathed recorded: Score-Determined Induced Tournament Statistics: an All-Orders Classification. Consult the linked registry entry for the original report and scope.
Opus 4.8 constructed a branch of the stated depth, giving a lower bound, and believed it had a matching upper bound; that proof was wrong and the statement stayed a conjecture. FABLE 5 later proved it. In the author's summary of the method: "The proof turns conjugation, near , into base- arithmetic." A cycle near the fixed point splits into a coarse base permutation and a vector of carries in ,…