Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
169 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

DAHA approach to iterated torus links (1509.08351v3)

Published 28 Sep 2015 in math.QA, math.GT, and math.RT

Abstract: We extend the construction of the DAHA-Jones polynomials for any reduced root systems and DAHA-superpolynomials in type A from the iterated torus knots (our previous paper) to links, including arbitrary algebraic links. Such a passage essentially corresponds to the usage of the products of Macdonald polynomials and is directly connected to the so-called splice diagrams. The specialization t=q of our superpolynomials conjecturally results in the HOMFLY-PT polynomials. The relation of our construction to the stable Khovanov-Rozansky polynomials and the so-called ORS-polynomials of the corresponding plane curve singularities is expected for algebraic links in the uncolored case. These 2 connections are less certain, since the Khovanov-Rozansky theory for links is not sufficiently developed and the ORS polynomials are quite involved. However we provide some confirmations. For Hopf links, our construction produces the DAHA-vertex, similar to the refined topological vertex, which is an important part of our paper.

Summary

We haven't generated a summary for this paper yet.