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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.