The Links-Gould polynomial distinguishes every Allen-Swenberg link AS(n) from the causally unrelated unlink, where the Alexander-Conway polynomial fails.
Title resolution pending
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
-
Detecting Causality with the Links--Gould Polynomial
The Links-Gould polynomial distinguishes every Allen-Swenberg link AS(n) from the causally unrelated unlink, where the Alexander-Conway polynomial fails.
-
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.