Metraipolis › archive › dc_e13c2b46471e
Knots, black holes, databases, and birthdays: Collision entropy of knot invariants — arXiv:2609.08298
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.08298
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-16T14:35:39.137Z
- SHA-256 of the archived text
30be80004db8cf57997c2837a3e93cafba96001f708928b5b8497f4523e2d3a6- Stable URL of this page
https://metraipolis.com/documento/dc_e13c2b46471e
How to cite
Knots, black holes, databases, and birthdays: Collision entropy of knot invariants — arXiv:2609.08298 — arXiv (en), https://arxiv.org/abs/2609.08298 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_e13c2b46471e (Metraipolis archive dc_e13c2b46471e, sha256 30be80004db8cf57997c2837a3e93cafba96001f708928b5b8497f4523e2d3a6)
BibTeX
@misc{dce13c2b46471e,
title = {Knots, black holes, databases, and birthdays: Collision entropy of knot invariants — arXiv:2609.08298},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.08298},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_e13c2b46471e; sha256 30be80004db8cf57997c2837a3e93cafba96001f708928b5b8497f4523e2d3a6},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.08298. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
A knot invariant is a fingerprint shared by equivalent knots: unequal values certify inequivalence, while equal values may conceal different knots. Under two rooted random-diagram models, we prove that the incomplete normalized Alexander polynomial separates random pairs but collides in a growing database. If $D_n$ and $D_n'$ are independent $n$-crossing diagrams, then $\Pr\{\Delta_{K(D_n)}=\Delta_{K(D_n')}\}=O(n^{-1/2})$, and every fixed normalized Alexander polynomial is exponentially rare. With exponentially high probability, the diagram shadow contains linearly many disjoint opened-trefoil slots. Conditional on the shadow and exterior crossing signs, their indicators are independent Bernoulli$(1/4)$ variables whose sum is a binomial coordinate in the $3$-adic determinant valuation. Consequently, $\sup_{a\geq 1}\Pr\{\det K(D_n)=a\}=O(n^{-1/2})$. For a discrete invariant $I$, let $\alpha_n(I)=\Pr\{I(D_n)=I(D_n')\}$. Its collision entropy is $H_2(I(D_n))=-\log\alpha_n(I)$. An independent sample of size $M$ has $\binom{M}{2}\alpha_n(I)$ colliding pairs on average and birthday scale $\alpha_n(I)^{-1/2}$. If $M_n^2\alpha_n(I)\to\infty$, a repeated value occurs with probability tending to one even when $\alpha_n(I)\to0$. For the determinant, $M=o(n^{1/4})$ suffices for collision freedom with high probability; a matching lower bound is open. We also give exact finite-population formulas for fixed censuses, calculate the expected cost of invariant cascades, and relate collision probability to the frequency of calls to a complete equivalence procedure. On a balanced pair-classification benchmark, the normalized-Alexander rule has balanced accuracy $1-O(n^{-1/2})$ but cannot distinguish inequivalent pairs in one fiber.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-09 in math.PR).
Categorie arXiv: Geometric Topology (math.GT) ; Probability (math.PR).
Pagina del lavoro: https://arxiv.org/abs/2609.08298 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-16T14:09:59.852Z dalla pagina https://arxiv.org/catchup/math.PR/2026-09-09?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).