pith. machine review for the scientific record. sign in

arxiv: 1601.04199 · v2 · submitted 2016-01-16 · ✦ hep-th · math.GT· math.QA· math.RT

Recognition: unknown

Tabulating knot polynomials for arborescent knots

Authors on Pith no claims yet
classification ✦ hep-th math.GTmath.QAmath.RT
keywords knotsarborescentpolynomialscoloredfeynmanknotmatricesterms
0
0 comments X
read the original abstract

Arborescent knots are the ones which can be represented in terms of double fat graphs or equivalently as tree Feynman diagrams. This is the class of knots for which the present knowledge is enough for lifting topological description to the level of effective analytical formulas. The paper describes the origin and structure of the new tables of colored knot polynomials, which will be posted at the dedicated site. Even if formal expressions are known in terms of modular transformation matrices, the computation in finite time requires additional ideas. We use the "family" approach, and apply it to arborescent knots in the Rolfsen table by developing a Feynman diagram technique associated with an auxiliary matrix model field theory. Gauge invariance in this theory helps to provide meaning to Racah matrices in the case of non-trivial multiplicities and explains the need for peculiar sign prescriptions in the calculation of [21]-colored HOMFLY polynomials.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Racah matrices for the symmetric representation of the SO(5) group

    hep-th 2026-03 unverdicted novelty 7.0

    Explicit R and Racah matrices are given for the symmetric representation of SO(5) to compute Kauffman polynomials via a generalized Reshetikhin-Turaev construction.

  2. Entangling gates for the SU(N) anyons

    hep-th 2026-05 unverdicted novelty 3.0

    The paper outlines the generalization of cabling-based entangling gates to SU(N) anyons and identifies differences and new problems that arise.