Matrices and finite biquandles (Q850843)

A quandle is the algebraic structure obtained by assigning a generator to each arc in an oriented knot diagram with a binary operation at each crossing, i.e., set \(c= a* b\) when \(b\) is the overcrossing arc, \(a\) the arc on the right-hand side of \(b\) when looking in the positive direction of the oriented arc \(b\), and \(c\) is the arc on the left-hand side of \(b\). The axioms are then derived from the Reidemeister moves, resulting in an algebraic structure which is an invariant of knot type. It is well known that the knot quandle is a complete invariant of classical knot type up to reflection, though in general quandle-equivalent knots need not be ambient isotopic. One way of strengthening the resulting invariant is to repeat the procedure used to derive the quandle definition from knot diagrams with semiarcs in place of arcs. These semiarcs are oriented edges in the underlying 4-valent graph of the knot diagram. Then one can obtain a new algebraic structure called biquandle. The authors describe a way of representing finite biquandles with \(n\) elements as \(2n\times 2n\) block matrices. Any finite biquandle defines an invariant of virtual knots through counting homomorphisms. The counting invariants of non-quandle biquandles can reveal information not present in the knot quandle, such as the non-triviality of the virtual trefoil and various Kishino knots. The authors exhibit an oriented virtual knot which is distinguished from both its observe and its reverse by a finite biquandle counting invariant. Finally, they classify biquandles of order 2, 3 and 4 and provide a URL for their Maple programs for computing with finite biquandles.