pith. sign in

Tabulating knot polynomials for arborescent knots

2 Pith papers cite this work. Polarity classification is still indexing.

2 Pith papers citing it
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.

citation-role summary

method 1

citation-polarity summary

fields

hep-th 2

years

2026 2

verdicts

UNVERDICTED 2

roles

method 1

polarities

use method 1

representative citing papers

Entangling gates for the SU(N) anyons

hep-th · 2026-05-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.

citing papers explorer

Showing 2 of 2 citing papers.

  • Racah matrices for the symmetric representation of the SO(5) group hep-th · 2026-03-23 · unverdicted · none · ref 17 · internal anchor

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

  • Entangling gates for the SU(N) anyons hep-th · 2026-05-05 · unverdicted · none · ref 28

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