Biracks and biquandles

In mathematics, biquandles and biracks are sets with binary operations that generalize quandles and racks. Biquandles take, in the theory of virtual knots, the place that quandles occupy in the theory of classical knots. Biracks and racks have the same relation, while a biquandle is a birack which satisfies some additional conditions.

Definitions

A birack is a set ${\displaystyle X}$, two right-invertible operations ${\displaystyle {\underline {\triangleright }}}$${\displaystyle ,{\overline {\triangleright }}}$ and a bijection ${\displaystyle \pi \colon X\to X}$ such that for all ${\displaystyle a,b,c\in X}$,

1. ${\textstyle \pi (a{\overline {\triangleright }}a)=a{\underline {\triangleright }}a}$ and ${\displaystyle \pi (a){\overline {\triangleright }}a=a{\underline {\triangleright }}\pi (a)}$.

2. The map ${\displaystyle H\colon X\times X\to X\times X}$ defined by ${\displaystyle H(a,b)=(b{\overline {\triangleright }}a,a{\underline {\triangleright }}b)}$ is invertible.

3. The exchange laws

• ${\displaystyle (a{\underline {\triangleright }}b){\underline {\triangleright }}(c{\underline {\triangleright }}b)=(a{\underline {\triangleright }}c){\underline {\triangleright }}(b{\overline {\triangleright }}c)}$

• ${\displaystyle (a{\underline {\triangleright }}b){\overline {\triangleright }}(c{\underline {\triangleright }}b)=(a{\overline {\triangleright }}c){\underline {\triangleright }}(b{\overline {\triangleright }}c)}$
• ${\displaystyle (a{\overline {\triangleright }}b){\overline {\triangleright }}(c{\overline {\triangleright }}b)=(a{\overline {\triangleright }}c){\overline {\triangleright }}(b{\underline {\triangleright }}c)}$.

If ${\textstyle \pi =id}$ is the identity map, ${\textstyle X}$ is called a biquandle. ^[1]

Biracks and Biquandles were first introduced by Roger Fenn, Mercedes Jordan-Santana and Louis Kauffman in 2004 ^[2] .

Note that the three conditions above correspond directly to the three Reidemeister moves in knot therory, showing the close connections between knots and biracks. ^[3]

Examples

Let ${\textstyle X}$ be a set with two bijection ${\displaystyle \sigma ,\tau \colon X\to X}$ that commute. Then the constant action birack is defined by ${\displaystyle a{\underline {\triangleright }}b=\sigma (a)}$ and ${\displaystyle a{\overline {\triangleright }}b=\tau (x)}$ and ${\displaystyle \pi (a)=\tau ^{-1}(\sigma (a))}$.

Any rack ${\displaystyle (X,\triangleright )}$ is a birack with ${\displaystyle a{\underline {\triangleright }}b=a\triangleright b}$ and ${\displaystyle a{\overline {\triangleright }}b=a}$ for all ${\displaystyle a,b\in X}$. Note that if we insert these operations into the conditions in the definition above, we regain the exact definition of a rack.

Let ${\displaystyle R}$ be a commutative ring with identity and ${\displaystyle X}$ an ${\displaystyle R[s^{\pm 1},t^{\pm 1}]}$-module. Then the Alexander biquandle is defined as ${\displaystyle a{\underline {\triangleright }}b=ta+(s-t)b}$ and ${\displaystyle a{\overline {\triangleright }}b=sa}$. For ${\displaystyle s=1}$ this is a quandle.

References

1. Elhamdadi, Mohamed; Nelson, Sam (2015). Quandles: an introduction to the algebra of knots. Student mathematical library. Providence: American mathematical society. ISBN   978-1-4704-2213-4.
2. Fenn, Roger; Jordan-Santana, Mercedes; Kauffman, Louis (2004-11-28). "Biquandles and virtual links". Topology and its Applications. 145 (1): 157–175. doi:10.1016/j.topol.2004.06.008. ISSN   0166-8641.
3. Pflume, Runa (2024-04-10). Generalizations of Quandles to Multi-Linkoids (masterThesis thesis). doi:10.53846/goediss-10442.

Further reading

• Fenn, Roger; Jordan-Santana, Mercedes; Kauffman, Louis (2004). "Biquandles and Virtual Links". Topology and its Applications. 145 (1–3): 157–175. doi: 10.1016/j.topol.2004.06.008 .
• Fenn, Roger; Rourke, Colin; Sanderson, Brian (1993). "An Introduction to Species and the Rack Space". Topics in Knot Theory. NATO ASI Series. Vol. 399. Springer. pp. 33–55. doi:10.1007/978-94-011-1695-4_4.
• Kauffman, Louis H. (1999). "Virtual Knot Theory". European Journal of Combinatorics . 20 (7): 663–690. doi: 10.1006/eujc.1999.0314 .