Computes symmetric ribbon numbers r_s(K) for knots of crossing number ≤12 and supplies polynomial lower bounds.
Genera of the arborescent links , url =
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
math.GT 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
Reshetikhin-Turaev knot polynomials are fixed-parameter tractable in the treewidth of the input diagram via tensor network contraction, yielding e^{O(sqrt n)} time.
citing papers explorer
-
Symmetric ribbon numbers of low-complexity knots
Computes symmetric ribbon numbers r_s(K) for knots of crossing number ≤12 and supplies polynomial lower bounds.
-
Fixed-parameter tractable computation of Reshetikhin--Turaev knot polynomials via tensor networks
Reshetikhin-Turaev knot polynomials are fixed-parameter tractable in the treewidth of the input diagram via tensor network contraction, yielding e^{O(sqrt n)} time.