REVIEW 3 cited by
Planar decomposition of bipartite HOMFLY polynomials in symmetric representations
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
Planar decomposition of bipartite HOMFLY polynomials in symmetric representations
abstract
We generalize the recently discovered planar decomposition (Kauffman bracket) for the HOMFLY polynomials of bipartite knot/link diagrams to (anti)symmetrically colored HOMFLY polynomials. Cabling destroys planarity, but it is restored after projection to (anti)symmetric representations. This allows to go beyond arborescent calculus, which so far produced the majority of results for colored polynomials. Technicalities include combinations of projectors, and these can be handled rigorously, without any guess-work -- what can be also useful for other considerations, where reliable quantization was so far unavailable. We explicitly provide simple examples of calculation of the HOMFLY polynomials in symmetric representations with the use of our planar technique. These examples reveal what we call the bipartite evolution and the bipartite decomposition of squares of $\mathcal{R}$-matrices eigenvalues in the antiparallel channel.
Forward citations
Cited by 3 Pith papers
-
Reductions in Khovanov-Rozansky operator formalism
Khovanov-Rozansky invariants are recast as a bicomplex of local operators D and conjugations χ^(±), with nilpotency on closed diagrams allowing reductions that simplify the hypercube construction.
-
Analogue of Goeritz matrices for computation of bipartite HOMFLY-PT polynomials
A modified Goeritz matrix is defined for bipartite link diagrams that reduces HOMFLY-PT computation for any N to matrix algebra.
-
Khovanov complexes for bipartite links
Shows that the Kauffman-Khovanov 2²-hypercube reduces to the bipartite 3-hypercube for N=2, confirming consistency of the reduction for bipartite links.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.