On geometric bases for A-polynomials II: su3 and Kuperberg bracket.
Saved in:
| Title: | On geometric bases for A-polynomials II: su3 and Kuperberg bracket. |
|---|---|
| Authors: | Galakhov, Dmitry1,2,3,4 (AUTHOR) d.galakhov.pion@gmail.com, Morozov, Alexei1,2,3,4 (AUTHOR) morozov@itep.ru |
| Source: | European Physical Journal C -- Particles & Fields. Aug2025, Vol. 85 Issue 8, p1-18. 18p. |
| Subjects: | Knot theory, Quantum groups, R-matrices, Gauge symmetries |
| Abstract: | We continue the study of quantum A-polynomials – equations for knot polynomials with respect to their coloring (representation-dependence) – as the relations between different links, obtained by hanging additional "simple" components on the original knot. Depending on the choice of this "decoration", the knot polynomial is either multiplied by a number or decomposes into a sum over "surrounding" representations by a cabling procedure. What happens is that these two of decorations, when complicated enough, become dependent – and this provides an equation. Remarkably it can be made independent of the representation. However, the equivalence of links is not a topological property – it follows from the properties of R-matrices, and strongly depends on the choice the gauge group and particular links. The relatively well studied part of the story concerns su 2 , where R-matrices can be chosen in an especially convenient Kauffman form, what makes the derivation of equations rather geometrical. To make these geometric methods somewhat simpler we suggest to use an arcade formalism/representation of the braid group to simplify decorating links universally. Here we attempt to extend this technique to the next case, su 3 , where the Kauffman rule is substituted by a more involved Kuperberg rule, still remains more geometric than generic analysis of MOY-diagrams, needed for higher ranks. Already in this case we encounter a classification problem for possible "decorations" and emergence of two-lined Young diagrams in enumeration of representations. [ABSTRACT FROM AUTHOR] |
| Copyright of European Physical Journal C -- Particles & Fields is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
|
Full text is not displayed to guests.
Login for full access.
|
|
| Abstract: | We continue the study of quantum A-polynomials – equations for knot polynomials with respect to their coloring (representation-dependence) – as the relations between different links, obtained by hanging additional "simple" components on the original knot. Depending on the choice of this "decoration", the knot polynomial is either multiplied by a number or decomposes into a sum over "surrounding" representations by a cabling procedure. What happens is that these two of decorations, when complicated enough, become dependent – and this provides an equation. Remarkably it can be made independent of the representation. However, the equivalence of links is not a topological property – it follows from the properties of R-matrices, and strongly depends on the choice the gauge group and particular links. The relatively well studied part of the story concerns su 2 , where R-matrices can be chosen in an especially convenient Kauffman form, what makes the derivation of equations rather geometrical. To make these geometric methods somewhat simpler we suggest to use an arcade formalism/representation of the braid group to simplify decorating links universally. Here we attempt to extend this technique to the next case, su 3 , where the Kauffman rule is substituted by a more involved Kuperberg rule, still remains more geometric than generic analysis of MOY-diagrams, needed for higher ranks. Already in this case we encounter a classification problem for possible "decorations" and emergence of two-lined Young diagrams in enumeration of representations. [ABSTRACT FROM AUTHOR] |
|---|---|
| ISSN: | 14346044 |
| DOI: | 10.1140/epjc/s10052-025-14648-2 |
