Asymptotic counting of knot types by stick number: manuscript, reproducibility code, Sphinx docs, and Lean verification.
-
Updated
Aug 7, 2026 - Lean
Asymptotic counting of knot types by stick number: manuscript, reproducibility code, Sphinx docs, and Lean verification.
Certified adaptive decomposition of implicit sets using interval enclosures, the Vertex Sufficiency Theorem, and Hilbert/Morton space-filling orderings. Includes a C++ core, Python bindings, tests, visualizations, and reproducible benchmarks.
To associate your repository with the semialgebraic-geometry topic, visit your repo's landing page and select "manage topics."