A fast polynomial-time knot invariant pair (Δ, θ) with superior distinguishing power on small knots, a genus bound, and simpler formulas for a previously studied quantity.
Bar-Natan,The Strongest Genuinely Computable Knot Invariant in 2024,talk given in Toronto (October 2024,http://drorbn.net/to24)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.GT 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
A Fast, Strong, Topologically Meaningful and Fun Knot Invariant
A fast polynomial-time knot invariant pair (Δ, θ) with superior distinguishing power on small knots, a genus bound, and simpler formulas for a previously studied quantity.