Given a knot, we find the braid representative that minimizes the number of simple walks. Such braids lead to an efficient method for computing the colored Jones polynomial of the knot, following an approach developed by Armond and implemented by Hajij and Levitt. We use this method to compute the colored Jones polynomial in closed form for the knots ?$5_2$?, ?$6_1$?, and ?$7_2$?. The set of simple walks can change under reflection, rotation, and cyclic permutation of the braid, and we prove an invariance property which relates the simple walks of a braid to those of its reflection under cyclic permutation. We study the growth rate of the number of simple walks for families of torus knots. Finally, we present a table of braid words that minimize the number of simple walks for knots up to 13 crossings.

Rights

URN

URN:NBN:SI:doc-1EWDSOSO

COBISSID

149286659

DOI

10.26493/1855-3974.2730.6ac

Added

02.10.2023

Metadata

Citation

APA:

Boden, Hans U., Shimoda, Matthew (2023). Braid representatives minimizing the number of simple walks. Ars mathematica contemporanea, volume 23, issue 1, P1.10 (27 str.). URN:NBN:SI:doc-1EWDSOSO from http://www.dlib.si

MLA:

Boden, Hans U., Shimoda, Matthew. "Braid representatives minimizing the number of simple walks." Ars mathematica contemporanea volume 23. issue 1 (2023) P1.10 (27 str.).
<http://www.dlib.si/?URN=URN:NBN:SI:doc-1EWDSOSO>

Ars mathematica contemporanea
2008-
(Assembly record)