Papers
Topics
Authors
Recent
Search
2000 character limit reached

The bracket polynomial of the Celtic link shadow $CK_4^{2n}$

Published 14 Aug 2025 in math.GT and math.CO | (2508.10410v1)

Abstract: We derive the Kauffman bracket polynomial for the shadow of the Celtic link $CK_4{2n}$ using two complementary approaches. The first approach uses a recursive relation within the Celtic framework of Gross and Tucker, based on diagrammatic identities. The second approach makes use of a 4-tangle algebraic framework: a fundamental tangle is concatenated with itself n times to form an iterated composite tangle, and the Kauffman bracket polynomial is computed by decomposing the state space with respect to the basis elements of the 4-strand diagram monoid.

Authors (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.