🔢 mathematics

Idempotents, automorphism groups, and commutator widths of quandle algebras

This paper advances the theory of quandle algebras by proving the absence of nontrivial idempotents in ordered commutative cases over specific integral domains, determining their automorphism groups for trivial and odd-order dihedral quandles, and identifying the first examples of quandle algebras with commutator width 2.

Original authors: Birama Sangare, Luc Ta

Published 2026-08-04

📖 6 min read🧠 Deep dive

CC BY 4.0

Original authors: Birama Sangare, Luc Ta

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). ✨ This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

Imagine a world where shapes and knots aren't just things you tie or draw, but objects you can do math with. In the 1980s, mathematicians discovered a special kind of algebra called a "quandle." Think of a quandle as a rulebook for how to twist and turn a knot without cutting it. If you have a knot, you can perform three basic moves (like untangling a shoelace), and a quandle is the mathematical structure that remembers exactly what happens when you do those moves. While these started as tools for studying knots, they've grown into a playground for algebra, showing up in quantum physics and geometry.

Now, imagine taking these knot-rulebooks and turning them into a "soup" of numbers. This is what mathematicians call a "quandle algebra." You take the rules of the quandle, mix them with a standard number system (like integers or fractions), and stir them together. The big question is: what kind of weird, new numbers can appear in this soup? Specifically, mathematicians are hunting for "idempotents." In plain English, an idempotent is a special ingredient that, when you mix it with itself, doesn't change at all. It's like a magical cookie that, if you eat a piece of it and then eat another piece of the same cookie, you still just have one cookie. The paper asks: In these knot-soups, do these magical, self-repeating ingredients exist, or are they impossible to find?

This paper dives deep into the kitchen to see what happens when the knot-rulebooks are "commutative" (meaning the order of mixing doesn't matter). The authors, Birama Sangare and Lực Ta, prove that if you use a specific type of number system (one that doesn't have a "2" that acts like zero), these knot-soups are surprisingly boring: they contain no magical, self-repeating ingredients other than the obvious ones. They also act as detectives to figure out exactly how many ways you can rearrange the ingredients in these soups without breaking the rules (this is called the "automorphism group"). Finally, they use a computer to stir up some non-commutative soups and measure how "twisty" they are. They found the very first examples of knot-soups that are so complex you need at least two "twists" to describe their messiness, a property called "commutator width."

The Magic of Knots and the Search for Self-Repeaters

To understand the paper's main discovery, let's look at the "idempotent" hunt. The authors were testing a hunch that if you have a "commutative" knot-rulebook (where the order of operations is friendly and predictable) and you mix it with a number system that isn't "broken" (specifically, one where the number 2 isn't zero), you won't find any hidden, self-repeating numbers.

They proved this is true for a very specific, well-behaved type of knot-rulebook called an "ordered commutative quandle." They showed that in these cases, the only self-repeating numbers are the "trivial" ones—the ones that were already there before you started mixing. It's like saying if you have a perfectly sorted deck of cards and you shuffle them according to a strict, non-conflicting rule, you can never create a new card that is its own copy. They also proved that you can't find these special numbers if you only use two or three ingredients in your mix. This rules out the idea that these magical numbers are hiding in the simplest parts of the soup.

However, the paper also shows that if you change the rules slightly—specifically, if you use a number system where "2" acts like zero (like in a world where 1+1=0)—then these magical numbers do appear. So, the paper doesn't say "idempotents never exist"; it says "they don't exist in these specific conditions."

The Shape-Shifting Groups

Next, the authors tackled the "automorphism groups." Imagine your knot-soup is a sculpture made of clay. An automorphism is a way to squish, stretch, or rotate that sculpture so that it still looks exactly the same from the inside, even if the pieces have moved around. The paper asks: How many different ways can you do this?

For "trivial" knot-rulebooks (where the rules are very simple and don't change anything), the authors found a precise formula for the number of ways to rearrange the soup. They showed that the group of these rearrangements is exactly the same as the group of "affine transformations" (a fancy math term for sliding and stretching a grid) on a grid that is one dimension smaller than the number of ingredients.

For "dihedral" knot-rulebooks (which are based on the symmetry of polygons, like a triangle or a pentagon) with an odd number of sides, they found a similar, though slightly more complex, formula. They discovered that the rearrangement group is a mix of a specific type of matrix group (symmetric circulant matrices) and the rearrangement group of the original rulebook. This solves a long-standing puzzle for these specific shapes. However, for dihedral rulebooks with an even number of sides, the answer isn't fully solved yet; the paper provides a partial map (an "embedding") showing how these groups fit inside a larger, known group, but the full picture remains a bit fuzzy.

Measuring the Twistiness

Finally, the authors turned to a computer to measure something called "commutator width." In algebra, a "commutator" is a measure of how much two things fail to commute (how much $A \times B$ differs from $B \times A$ ). The "width" is a way of counting how many of these "twists" you need to build any complex mess in the soup. If the width is 1, the soup is relatively simple. If it's 2, it's more tangled.

Before this paper, it was known that some knot-soups had a width of 1. The authors used a computer search to test many different knot-rulebooks and number systems. They found the first known examples of knot-soups with a width of 2. Specifically, they found that a dihedral quandle of order 5 mixed with the number system of 5 elements ( $F_5[R_5]$ ) has a width of 2. They also found a specific, non-commutative knot-rulebook of order 8 (labeled LRQ.Quandle(8, 1367)) that has a width of 2 when mixed with fields of 2 or 3 elements.

This is a big deal because it proves that knot-soups can be more complex than previously thought. The computer didn't just guess; it exhaustively checked every possible combination in these small systems and found specific examples where you absolutely need two twists to describe the mess. The paper doesn't claim this is the maximum complexity possible, but it definitely breaks the record for the first time, showing that the world of quandle algebras has more layers of complexity than we knew.

In short, this paper draws a clear line in the sand: for certain well-behaved knot-rulebooks, the magical self-repeating numbers are impossible to find, and the ways to rearrange them are now fully mapped out. But for the more chaotic, non-commutative ones, the computer has just opened the door to a new level of twistiness, proving that some knot-soups are indeed more complicated than they look.

Technical Summary: Idempotents, Automorphism Groups, and Commutator Widths of Quandle Algebras

Problem Statement
This paper addresses the development of the theory of quandle algebras, specifically focusing on three structural properties: the existence of nontrivial idempotents, the computation of automorphism groups, and the determination of commutator widths. While quandle rings were introduced in [6] as a nonassociative analogue to group rings, and subsequent works [7, 14] investigated specific cases (such as small-order quandles and isomorphism problems), a comprehensive theory for commutative quandles and their algebras over arbitrary rings remained underdeveloped. The authors aim to resolve specific conjectures regarding idempotents in ordered commutative quandles, compute automorphism groups for trivial and dihedral quandles, and provide the first known examples of quandle algebras with commutator width greater than 1.

Methodology
The paper employs a combination of algebraic manipulation, structural analysis of nonassociative algebras, and computational enumeration:

Algebraic Proofs: The authors utilize the axioms of quandles (specifically commutativity and orderability) to analyze the multiplication in quandle algebras $k[Q]$ . They investigate idempotents by expanding elements $u = \sum \alpha_i x_i$ and solving the resulting systems of equations over integral domains, particularly focusing on the length of elements (the number of non-zero coefficients).
Structural Decomposition: For automorphism groups, the authors exploit functorial properties and module decompositions. Specifically, they utilize the isomorphism $R_{2n} \cong R_n \times T_2$ (where $R_n$ is a dihedral quandle and $T_2$ is a trivial quandle of order 2) to relate the algebra $k[R_{2n}]$ to a constructed algebra $A^k_{R_n}$ . They also analyze the action of affine groups and symmetric circulant matrices on these structures.
Computational Search: To determine commutator widths, the authors utilize the GAP system and the "Rack and Quandle Library" [34]. They perform exhaustive searches over finite fields $\mathbb{F}_q$ for dihedral quandles $R_n$ and noncommutative quandles of small orders (up to 8) to calculate the minimum number of commutators required to express elements in the commutator subalgebra.

Key Contributions and Results

Idempotents in Commutative Quandle Algebras:
- The authors prove that over an integral domain $k$ with $\text{char}(k) \neq 2$ , the quandle algebra $k[Q]$ of an ordered commutative quandle $Q$ contains no nontrivial idempotents (Theorem 3.8). This verifies Conjecture 3.2 (from [17]) for this specific class.
- They demonstrate that for commutative quandles, there are no nontrivial idempotents of length 2 or 3 (Theorem 3.6).
- Conversely, they show that for groups $G$ of exponent 2, the algebra $k[\text{Core}(G)]$ does contain nontrivial idempotents, providing a negative answer to a question posed in [4] regarding infinite fields without zero divisors.
- For fields of characteristic 2, they characterize the set of idempotents in finite commutative quandle algebras as the set of all sums of distinct basis elements (Proposition 3.11).
Automorphism Groups:
- Trivial Quandles: The authors establish that for a trivial quandle $T_n$ of order $n$ , the automorphism group of the algebra is isomorphic to the general affine group: $\text{Aut}(k[T_n]) \cong \text{Aff}_{n-1}(k)$ (Theorem 4.4).
- Dihedral Quandles (Even Order): For odd integers $n \ge 1$ , the authors prove that the automorphism group of the dihedral quandle of order $2n$ (an even order quandle) satisfies $\text{Aut}(k[R_{2n}]) \cong \text{Aff}_1(\text{SC}_n(k)) \rtimes \text{Aut}(k[R_n])$ , where $\text{SC}_n(k)$ is the ring of symmetric circulant matrices (Theorem 4.13).
- Dihedral Quandles (Even Order): While a complete classification for even orders remains open, the authors construct a canonical embedding $\text{Aut}(k[R_{2n}]) \hookrightarrow \text{GL}_n(k) \times \text{Aut}(k[R_n])$ for integral domains with characteristic not equal to 2 (Theorem 4.15). This addresses Problem 6.5 from [7].
Commutator Widths:
- The paper provides the first known examples of quandle algebras with commutator width greater than 1.
- Through computer search, they identify that the commutator width of $\mathbb{F}_5[R_5]$ is 2, and the commutator width of $\mathbb{F}_p[Q]$ is 2 for a specific noncommutative quandle $Q$ of order 8 (identified as LRQ.Quandle(8, 1367)) over $\mathbb{F}_2$ and $\mathbb{F}_3$ (Theorems 5.4, 5.5, 5.6).
- For most other tested cases (dihedral quandles $R_n$ with $n \le 21$ and various fields), the commutator width is found to be 1.

Significance
The paper claims to advance the theory of quandle algebras by resolving specific conjectures regarding idempotents in ordered commutative settings and providing explicit structural descriptions of automorphism groups for trivial and odd-order dihedral quandles. A primary significance highlighted by the authors is the computational discovery of quandle algebras with commutator width 2. This finding challenges the intuition that such widths might be universally 1 (as seen in trivial quandles and $R_4$ ) and establishes a new frontier in the study of nonassociative algebras derived from knot-theoretic structures. The work also partially answers open problems posed in previous literature [7, 17] regarding the classification of automorphism groups and the existence of nontrivial idempotents.

The Magic of Knots and the Search for Self-Repeaters

The Shape-Shifting Groups

Measuring the Twistiness

More like this