Symbolic computation with finite biquandles (Q2469236)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Symbolic computation with finite biquandles
scientific article

    Statements

    Symbolic computation with finite biquandles (English)
    0 references
    0 references
    0 references
    4 February 2008
    0 references
    A biquandle is a nonassociative algebraic structure whose axioms follow from the desire to assign biquandle elements to the semi-arcs of virtual link diagrams in a way that makes the number of such assignments (colorings) an invariant under generalized Reidemeister moves. The number of colorings is the simplest invariant that can be obtained from a given biquandle. The more sophisticated invariants are obtained from certain functions that assign a weight to each crossing in the colored link diagram. These functions are elements of the second Yang-Baxter cohomology of the biquandle used in the coloring as defined in \textit{J. S. Carter, M. Elhamdadi} and \textit{M. Saito} [Fundam. Math. 184, 31--54 (2004; Zbl 1067.57006)]. In this paper, the authors describe a method of computing a basis for the second Yang-Baxter cohomology of a finite biquandle with coefficients in \(\mathbb Q\) and \(\mathbb Z_p\) from a matrix presentation of the finite biquandle. They also give a method for computing the Yang-Baxter cocycle invariants of an oriented knot or link represented as a signed Gauss code (a URL for Maple implementations of these algorithms is provided).
    0 references
    Yang-Baxter cohomology
    0 references
    knot invariants
    0 references
    virtual knot invariants
    0 references
    finite biquandles
    0 references
    symbolic computation
    0 references

    Identifiers