Kauffman 4-Strand Diagram Monoid

• The Kauffman 4-strand diagram monoid is a planar algebraic structure defined as N × J₄, with 14 unique noncrossing connectivity types and an additional loop-count parameter.
• It is presented using a loop generator c and hooks h₁, h₂, h₃ under Temperley–Lieb relations, leading to a unique Jones normal form and enabling polynomial-time identity testing.
• Its applications span computational knot theory and bracket state propagation, underpinning finite-state transfer algebras in 4-tangle and skein algebra analyses.

The Kauffman 4-strand diagram monoid is the 4-strand specialization of the planar Kauffman–Temperley–Lieb diagram calculus. In semigroup-theoretic form it is the monoid $\mathcal K_4=\mathbb N\times \mathcal J_4$, where $\mathcal J_4$ is the Jones monoid of planar non-crossing pairings on four top and four bottom vertices, and the extra $\mathbb N$-coordinate records the number of closed middle loops created under composition. In algebraic presentation form it is generated by a loop element $c$ and hooks $h_1,h_2,h_3$ subject to Temperley–Lieb relations. In computational knot-theoretic work, the same 4-strand planar connectivity types appear as a 14-element basis $g_1,\dots,g_{14}$ for bracket-state propagation under concatenation (Dolinka et al., 2015, Kitov et al., 2019, Ramaharo, 25 Aug 2025).

1. Definitions and competing conventions

Fix $n\in\mathbb N$. The Jones or Temperley–Lieb monoid $\mathcal J_n$ consists of planar Brauer diagrams on top vertices $1,\dots,n$ and bottom vertices $1',\dots,n'$, with every block of size $\mathcal J_4$0. The Kauffman diagram monoid is then defined as

$\mathcal J_4$1

with a twisted product that adds a loop count to the first coordinate. For $\mathcal J_4$2, $\mathcal J_4$3 has $\mathcal J_4$4 elements, so the circle-free planar core already has 14 distinct connectivity types (Dolinka et al., 2015).

A parallel algebraic presentation uses generators $\mathcal J_4$5 and relations

$\mathcal J_4$6

For $\mathcal J_4$7, this gives generators $\mathcal J_4$8. Diagrammatically, this presented monoid is isomorphic to the planar connection monoid on four strands with circles, so the loop generator $\mathcal J_4$9 and the $\mathbb N$0-coordinate in $\mathbb N$1 encode the same loop-counting phenomenon in different languages [(Dolinka et al., 2016); (Auinger et al., 2014)].

In the 4-tangle bracket literature, the phrase “Kauffman 4-strand diagram monoid” is used operationally for a fixed basis of 14 planar 4-strand states $\mathbb N$2, with loops absorbed into coefficients in $\mathbb N$3 rather than kept as separate monoid data. In generalized diagram-category language, the same 4-strand object appears as the Temperley–Lieb/Kauffman monoid $\mathbb N$4, again with 14 planar basis diagrams (Ramaharo, 25 Aug 2025, Fresacher et al., 19 Dec 2025).

Realization	Elements in the 4-strand case	Treatment of loops
Twisted semigroup $\mathbb N$5	Pairs $\mathbb N$6 with $\mathbb N$7	Stored in the $\mathbb N$8-coordinate
Presented monoid $\mathbb N$9	Words in $c$0 modulo TL relations	Stored by powers of $c$1
State basis $c$2	14 circle-free planar states	Absorbed into coefficients in $c$3
Categorical $c$4	14 planar matchings	Each floating loop evaluates to $c$5

This suggests that most differences in usage concern bookkeeping rather than the underlying planar 4-strand connectivity data.

2. Diagrammatics and multiplication

A 4-strand Jones diagram has top vertices $c$6 and bottom vertices $c$7. Its pairs may be upper hooks $c$8, lower hooks $c$9, or transversals $h_1,h_2,h_3$0, subject to planarity. Typical examples are the identity diagram

$h_1,h_2,h_3$1

and the rank-$h_1,h_2,h_3$2 hook diagram

$h_1,h_2,h_3$3

For $h_1,h_2,h_3$4, possible ranks are $h_1,h_2,h_3$5 (Dolinka et al., 2015).

Multiplication is defined by stacking diagrams. If $h_1,h_2,h_3$6, one composes them by placing $h_1,h_2,h_3$7 above $h_1,h_2,h_3$8, identifying the middle row, and tracing the resulting planar connections. In the Kauffman monoid this is twisted by the number $h_1,h_2,h_3$9 of floating middle loops: $g_1,\dots,g_{14}$0 The second coordinate is the ordinary Jones product; the first coordinate accumulates loop count. This is the standard loop-counting twist corresponding to the exponent of the Temperley–Lieb loop parameter in the algebra product $g_1,\dots,g_{14}$1 (Dolinka et al., 2015).

The same composition law appears in the connection-monoid model. There one works with left pins $g_1,\dots,g_{14}$2, right pins $g_1,\dots,g_{14}$3, t-wires, l-wires, r-wires, and circles. Multiplication glues right pins of the first diagram to left pins of the second, then traces outer connections and counts new circles. The identity is the diagram with straight through wires $g_1,\dots,g_{14}$4, and each hook $g_1,\dots,g_{14}$5 joins $g_1,\dots,g_{14}$6 to $g_1,\dots,g_{14}$7 on one side and $g_1,\dots,g_{14}$8 to $g_1,\dots,g_{14}$9 on the other (Kitov et al., 2019).

In the 4-tangle state-space approach, one fixes 14 basis diagrams $n\in\mathbb N$0. Any smoothed 4-tangle state is expressed as a linear combination of these basis states, and concatenation of tangles induces multiplication through the concatenation table of the $n\in\mathbb N$1. The identity basis state is the straight-through 4-strand diagram, represented by the initial vector

$n\in\mathbb N$2

in transfer-matrix calculations (Ramaharo, 25 Aug 2025).

3. Idempotents, interface graphs, and the 4-strand count

An element $n\in\mathbb N$3 of a monoid is idempotent if $n\in\mathbb N$4. In the twisted Kauffman monoid this becomes

$n\in\mathbb N$5

hence

$n\in\mathbb N$6

Therefore an idempotent must satisfy

$n\in\mathbb N$7

The classification in planar diagram monoids is phrased in terms of the interface graph $n\in\mathbb N$8 associated to a diagram $n\in\mathbb N$9 (Dolinka et al., 2015).

For $\mathcal J_n$0, and in particular for $\mathcal J_n$1, the interface graph $\mathcal J_n$2 has vertex set $\mathcal J_n$3. Upper hooks give edges colored $\mathcal J_n$4, lower hooks give edges colored $\mathcal J_n$5, and each vertex $\mathcal J_n$6 receives a color $\mathcal J_n$7 recording whether $\mathcal J_n$8 belongs to the codomain and domain of transversals. Because the original diagram is planar, every connected component of $\mathcal J_n$9 is either a cycle or a path, with alternating edge colors. Paths are classified as active, inactive, or mixed according to endpoint colors.

For Jones idempotents, every component of $1,\dots,n$0 must be either a cycle or an active path of even length. For Kauffman idempotents, the twist imposes the stronger condition that every component must be an active path of even length; cycles and inactive paths are excluded because they create floating middle loops. Corollary 3.7 states: $1,\dots,n$1 Equivalently, Kauffman idempotents are precisely those Jones idempotents whose interface graphs have no cycle components (Dolinka et al., 2015).

The paper gives an explicit enumeration formula

$1,\dots,n$2

where $1,\dots,n$3 records cycle components containing both upper and lower outer hooks, and $1,\dots,n$4 count the corresponding outer hooks. For $1,\dots,n$5, the outcome is

$1,\dots,n$6

One of these five is the identity diagram. Its interface graph has four isolated vertices, each colored $1,\dots,n$7, so every component is an active path of even length $1,\dots,n$8. The remaining four idempotents are not listed explicitly in the paper, but the general theory shows that each is of the form $1,\dots,n$9 with a cycle-free active-path interface graph (Dolinka et al., 2015).

4. Presentations, normal forms, idempotent generation, and identities

The presented Kauffman monoid $1',\dots,n'$0 admits a canonical Jones normal form. Writing

$1',\dots,n'$1

every element has a unique form

$1',\dots,n'$2

with $1',\dots,n'$3 and strictly increasing sequences $1',\dots,n'$4 and $1',\dots,n'$5. For $1',\dots,n'$6, the available indices are $1',\dots,n'$7, so all normal forms are built from the six blocks $1',\dots,n'$8 and powers of $1',\dots,n'$9 (Dolinka et al., 2016).

A key refinement colors each block by parity. A block is white if its endpoints have different parity, blue if both endpoints are odd, and red if both are even. If $\mathcal J_4$00, $\mathcal J_4$01, and $\mathcal J_4$02 denote the numbers of blue blocks, red blocks, and occurrences of $\mathcal J_4$03 in the normal form of $\mathcal J_4$04, then the characteristic number is

$\mathcal J_4$05

The main criterion is

$\mathcal J_4$06

where $\mathcal J_4$07 is the idempotent-generated subsemigroup. For $\mathcal J_4$08,

$\mathcal J_4$09

A minimal idempotent generating set is provided by the four length-$\mathcal J_4$10 blocks and inverse blocks

$\mathcal J_4$11

in this small case (Dolinka et al., 2016).

The equational theory of the 4-strand monoid is unusually rigid. The identities of $\mathcal J_4$12 are nonfinitely based for every $\mathcal J_4$13, and this remains true when $\mathcal J_4$14 is regarded as an involution semigroup under either natural involution. Thus $\mathcal J_4$15 has no finite identity basis (Auinger et al., 2014).

At the same time, $\mathcal J_4$16 admits an unexpectedly tractable identity theory. The monoids $\mathcal J_4$17 and $\mathcal J_4$18 satisfy exactly the same identities. An identity $\mathcal J_4$19 holds in $\mathcal J_4$20 if and only if $\mathcal J_4$21 and, for every subset $\mathcal J_4$22, the words $\mathcal J_4$23 and $\mathcal J_4$24 obtained by deleting all letters in $\mathcal J_4$25 have the same first letter, the same last letter, and the same number of occurrences of every word of length $\mathcal J_4$26. This yields a polynomial-time identity-checking algorithm for $\mathcal J_4$27, with time $\mathcal J_4$28 when $\mathcal J_4$29 and $\mathcal J_4$30 (Kitov et al., 2019).

A common misconception is that nonfinite basability should imply intractable identity checking. Here the two phenomena coexist: finite axiomatizability fails, but the decision problem remains polynomial-time.

5. Finite-state transfer algebra for 4-tangles

In the recursive computation of bracket polynomials for iterated 4-tangles, the Kauffman 4-strand diagram monoid functions as a finite state space. A 4-tangle shadow $\mathcal J_4$31 is expanded as

$\mathcal J_4$32

where $\mathcal J_4$33 is a fixed basis of 14 elementary planar 4-strand diagrams and $\mathcal J_4$34. Concatenation of tangles induces a linear transformation on the coefficient vector

$\mathcal J_4$35

If $\mathcal J_4$36, then

$\mathcal J_4$37

where $\mathcal J_4$38 is a $\mathcal J_4$39 states matrix with entries in $\mathcal J_4$40 and

$\mathcal J_4$41

corresponds to the identity state (Ramaharo, 25 Aug 2025).

Closure turns the state vector into a bracket polynomial. In one formulation, a closure-weight vector

$\mathcal J_4$42

gives

$\mathcal J_4$43

Thus the entire bracket recursion is reduced to repeated multiplication by a fixed $\mathcal J_4$44 matrix. For the square Turk’s head generator, the bracket expansion has coefficients

$\mathcal J_4$45

with all other $\mathcal J_4$46 (Ramaharo, 25 Aug 2025).

The same 14-state framework appears in the Celtic-link computation. There the fundamental tangle $\mathcal J_4$47 has

$\mathcal J_4$48

and the associated $\mathcal J_4$49 state matrix $\mathcal J_4$50 has characteristic polynomial

$\mathcal J_4$51

with

$\mathcal J_4$52

After closure,

$\mathcal J_4$53

and the matrix-eigenvalue analysis yields a closed form for $\mathcal J_4$54 (Ramaharo, 14 Aug 2025).

The two bracket papers use the same 14-state philosophy but different closure data. This indicates that basis orderings and closure conventions vary across the literature, even when the underlying 4-strand state space is the same.

6. Skein algebras, character varieties, and generalized diagram categories

The phrase “Kauffman 4-strand diagram monoid” does not appear explicitly in the study of the Kauffman bracket skein algebra of the 4-holed disk, but the natural matching object is the diagrammatic multiplicative structure of

$\mathcal J_4$55

where multiplication is stacking. The generators are simple closed curves

$\mathcal J_4$56

indexed by nonempty subsets of $\mathcal J_4$57. The algebra admits a monomial basis over $\mathcal J_4$58 consisting of words

$\mathcal J_4$59

with $\mathcal J_4$60 in an explicitly listed set of heavy generators involving $\mathcal J_4$61. In the classical limit $\mathcal J_4$62, these diagram generators map to trace functions on the $\mathcal J_4$63-character variety of the rank-4 free group $\mathcal J_4$64 (Chen, 2024).

A different skein-theoretic extension appears in the exterior of a 4-strand Montesinos knot. There the boundary diagram algebra acts on the skein module of a handlebody, and passing to the knot exterior imposes relations identifying the four boundary meridians. The resulting skein module contains nonzero torsion: there exists $\mathcal J_4$65 with

$\mathcal J_4$66

and more generally a family $\mathcal J_4$67 with

$\mathcal J_4$68

This provides a negative answer to Kirby’s Problem 1.92 (G)-(i) in that 4-strand Montesinos setting (Chen, 2023).

In the 2025 generalized-cobordism framework, the classical Kauffman object is identified with the Temperley–Lieb/Kauffman monoid $\mathcal J_4$69. It has 14 elements partitioned into three $\mathcal J_4$70-classes $\mathcal J_4$71 according to through-strand counts $\mathcal J_4$72, so the decomposition is $\mathcal J_4$73. In the generic semisimple regime, the corresponding simple modules have dimensions $\mathcal J_4$74. The same paper shows that tight twistings preserve Green-theoretic cell structure in a controlled way, so Kauffman-type loop-counting twists are representation-theoretically mild (Fresacher et al., 19 Dec 2025).

Taken together, these developments place the Kauffman 4-strand diagram monoid at an intersection of semigroup theory, transfer-matrix methods, skein algebras, and categorical representation theory. Its smallest nontrivial 4-strand instance already exhibits infinite loop-counting structure, a finite 14-state planar core, nontrivial idempotent combinatorics, nonfinite equational basis behavior, polynomial-time identity checking, and direct applications to bracket-polynomial recursion.