REVIEW 2 cited by
Planar decomposition of the HOMFLY polynomial for bipartite knots and links
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
The theory of the Kauffman bracket, which describes the Jones polynomial as a sum over closed circles formed by the planar resolution of vertices in a knot diagram, can be straightforwardly lifted from sl(2) to sl(N) at arbitrary N -- but for a special class of bipartite diagrams made entirely from the anitparallel lock tangle. Many amusing and important knots and links can be described in this way, from twist and double braid knots to the celebrated Kanenobu knots for even parameters -- and for all of them the entire HOMFLY polynomials possess planar decomposition. This provides an approach to evaluation of HOMFLY polynomials, which is complementary to the arborescent calculus, and this opens a new direction to homological techniques, parallel to Khovanov-Rozansky generalisations of the Kauffman calculus. Moreover, this planar calculus is also applicable to other symmetric representations beyond the fundamental one, and to links which are not fully bipartite what is illustrated by examples of Kanenobu-like links.
Forward citations
Cited by 2 Pith papers
-
On geometric bases for A-polynomials II: $\mathfrak{su}_3$ and Kuberberg bracket
A new arcade-based planarization technique plus the Kuperberg bracket yields a closed system of classical relations toward su3 A-polynomials, demonstrated on the trefoil.
-
Bipartite expansion beyond biparticity
The authors construct positive decompositions of fundamental HOMFLY polynomials in variables φ, φ̄, D for arbitrary knots, not just bipartite ones, and give a criterion to detect when such a decomposition conceals a b...
Discussion (0). Continue with ORCID to comment.