The one-row colored $\mathfrak{sl}_{3}$ Jones polynomials for pretzel links
Kotaro Kawasoe

TL;DR
This paper computes the one-row $ ext{sl}_3$ colored Jones polynomials for certain pretzel links using skein theory and demonstrates the existence of polynomial tails for specific alternating pretzel knots.
Contribution
It provides explicit formulas for the one-row $ ext{sl}_3$ Jones polynomials of pretzel links and proves tail existence for a family of alternating pretzel knots.
Findings
Explicit formulas for $J_{(n, 0)}^{ ext{sl}_3}$ for pretzel links
Calculation method using Kuperberg's skein theory
Proof of tail existence for certain alternating pretzel knots
Abstract
The colored Jones polynomial are given by a link and an -irreducible representation of . In general, it is hard to calculate for an oriented link . However, we calculate the one-row colored Jones polynomials for three-parameter families of oriented pretzel links by using Kuperberg's linear skein theory by setting . Furthermore, we show the existence of the tails of for the alternating pretzel knots .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGeometric and Algebraic Topology · Advanced Combinatorial Mathematics · Algebraic structures and combinatorial models
