Abstract
We make a new attempt at the recently suggested program to express knot polynomials through topological vertices, which can be considered as a possible approach to the tangle calculus: we discuss the Macdonald deformation of the relation between the convolution of two topological vertices and the HOMFLY-PT invariant of the 4-component link L8n8, which both depend on four arbitrary representations. The key point is that both of these are related to the Hopf polynomials in composite representations, which are in turn expressed through composite Schur functions. The latter are further expressed through the skew Schur polynomials via the remarkable Koike formula. It is this decomposition that breaks under the Macdonald deformation and gets restored only in the (large N) limit of A±1⟶0. Another problem is that the Hopf polynomials in the composite representations in the refined case are “chiral bilinears” of Macdonald polynomials, while convolutions of topological vertices involve “non-chiral combinations” with one of the Macdonald polynomials entering with permuted t and q. There are also other mismatches between the Hopf polynomials in the composite representation and the topological 4-point function in the refined case, which we discuss.
Highlights
In [1] we started a new program to construct link polynomials (LP)1 [2] from topological vertices (TV) [3]
On of the main reasons is that related to the TV are the colored LP, the relevant ones are those in composite representations, which essentially depend on the rank of the gauge algebra, i.e. on N for SLN
The natural step is to lift the construction from the HOMFLY-PT to hyperpolynomials, i.e. from the Schur polynomial based expressions to those based on the Macdonald polynomials and depending on three rather than two parameters: A, q and t
Summary
In [1] we started a new program to construct link polynomials (LP)1 [2] from topological vertices (TV) [3]. The natural step is to lift the construction from the HOMFLY-PT to hyperpolynomials, i.e. from the Schur polynomial based expressions to those based on the Macdonald polynomials and depending on three rather than two parameters: A, q and t. This runs into a set of problems, which we discuss in the present paper. The story is quite a usual one for superpolynomials, where answers at particular N (KhovanovRozansky polynomials [14]) are related to the A-dependent quantities by a conceptually obscure DGR trick [15] It looks like, perhaps unexpectedly, the situation is going to be the same even for the hyperpolynomials, at least in the composite (i.e. N -dependent) representations. Notice that we make a change of parameters (q, t) → (q2, t2) in the Macdonald polynomials as compared with [20]
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.