pith. machine review for the scientific record. sign in

arxiv: 1711.10952 · v3 · submitted 2017-11-29 · ✦ hep-th

Recognition: unknown

Eigenvalue hypothesis for multi-strand braids

Authors on Pith no claims yet
classification ✦ hep-th
keywords matricesbraidshypothesiseigenvalueeigenvaluesforminclusivemathcal
0
0 comments X
read the original abstract

Computing polynomial form of the colored HOMFLY-PT for non-arborescent knots obtained from three or more strand braids is still an open problem. One of the efficient methods suggested for the three-strand braids relies on the eigenvalue hypothesis which uses the Yang-Baxter equation to express the answer through the eigenvalues of the ${\cal R}$-matrix. In this paper, we generalize the hypothesis to higher number of strands in the braid where commuting relations of non-neighbouring $\mathcal{R}$ matrices are also incorporated. By solving these equations, we determine the explicit form for $\mathcal{R}$-matrices and the inclusive Racah matrices in terms of braiding eigenvalues (for matrices of size up to 6 by 6). For comparison, we briefly discuss the highest weight method for four-strand braids carrying fundamental and symmetric rank two $SU_q(N)$ representation. Specifically, we present all the inclusive Racah matrices for representation $[2]$ and compare with the matrices obtained from eigenvalue hypothesis.

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.