arXiv math/05083512005-08math.GT

Symbolic computation with finite quandles

Richard Henderson, Todd Macedo, Sam Nelson

备注：: 6 pages. Version 2 includes some updates and corrections. Code has been relocated to www.esotericka.org/quandles. To appear in J. Symbolic Computation
发表信息：: J. Symbolic Comput. 41 (2006) 811-817.

英文摘要：

Algorithms are described and Maple implementations are provided for finding all quandles of order $n$, as well as computing all homomorphisms between two finite quandles or from a finitely presented quandle (e.g., a knot quandle) to a finite quandle, computing the automorphism group of a finite quandle, etc. Several of these programs work for arbitrary binary operation tables and hence algebraic structures other than quandles. We also include a stand-alone C program which finds quandles of order $n$ and provide URLs for files containing the results for $n=6,$ 7 and 8.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Computations of quandle cocyle invariants of surface-links using marked graph diagrams

By using the cohomology theory of quandles, quandle cocycle invariants and shadow quandle cocycle invariants are defined for oriented links and surface-links via broken surface diagrams. By using symmetric quandles, symmetric quandle cocycle invariants are also defined for unoriented links and surface-links via broken surface diagrams. A marked graph diagram is a link diagram possibly with $4$-valent vertices equipped with markers. S. J. Lomonaco, Jr. and K. Yoshikawa introduced a method of describing surface-links by using marked graph diagrams. In this paper, we give interpretations of these…

2015-02-05math.GT

Computation of quandle 2-cocycle knot invariants without explicit 2-cocycles

We explore a knot invariant derived from colorings of corresponding $1$-tangles with arbitrary connected quandles. When the quandle is an abelian extension of a certain type the invariant is equivalent to the quandle $2$-cocycle invariant. We construct many such abelian extensions using generalized Alexander quandles without explicitly finding $2$-cocycles. This permits the construction of many $2$-cocycle invariants without exhibiting explicit $2$-cocycles. We show that for connected generalized Alexander quandles the invariant is equivalent to Eisermann's knot coloring polynomial. Computatio…

2016-08-05math.GT

Computations of Quandle Cocycle Invariants of Knotted Curves and Surfaces

State-sum invariants for knotted curves and surfaces using quandle cohomology were introduced by Laurel Langford and the authors in math.GT/9903135 In this paper we present methods to compute the invariants and sample computations. Computer calculations of cohomological dimensions for some quandles are presented. For classical knots, Burau representations together with Maple programs are used to evaluate the invariants for knot table. For knotted surfaces in 4-space, movie methods and surface braid theory are used. Relations between the invariants and symmetries of knots are discussed.

1999-06-17math.GT

纽结对称广群的计算及其在曲面链plat指数中的应用

Computation of the knot symmetric quandle and its application to the plat index of surface-links

该研究提出利用plat形式表示计算曲面链的纽结对称广群，并证明了对任意整数g≥0和m≥2，存在无穷多亏格为g且plat指数为m的不同曲面纽结。

2023-08-28math.GT

Diagrammatic Computations for Quandles and Cocycle Knot Invariants

The state-sum invariants for knots and knotted surfaces defined from quandle cocycles are described using the Kronecker product between cycles represented by colored knot diagrams and a cocycle of a finite quandle used to color the diagram. Such an interpretation is applied to evaluating the invariants. Algebraic interpretations of quandle cocycles as deformations of extensions are also given. The proofs rely on colored knot diagrams.

2001-02-12math.GTmath.QA

On the classification of quandles of low order

Using the classification of transitive groups we classify indecomposable quandles of size <36. This classification is available in Rig, a GAP package for computations related to racks and quandles. As an application, the list of all indecomposable quandles of size <36 not of type D is computed.

2012-01-26math.GTmath.QA

更多相关论文收起更多论文

Automorphism groups of Quandles

We prove that the automorphism group of the dihedral quandle with n elements is isomorphic to the affine group of the integers mod n, and also obtain the inner automorphism group of this quandle. In [9], automorphism groups of quandles (up to isomorphisms) of order less than or equal to 5 were given. With the help of the software Maple, we compute the inner and automorphism groups of all seventy three quandles of order six listed in the appendix of [4]. Since computations of automorphisms of quandles relates to the problem of classification of quandles, we also describe an algorithm implemente…

2010-12-23math.GRmath.GT

通过quandle环的幂等元对链接着色的增强

Enhancements of link colorings via idempotents of quandle rings

本文利用quandle环的幂等元构造了链环着色不变量的增强，证明其强于经典着色不变量及medial情形下的Hom quandle不变量，并通过计算小阶quandle的幂等元与Peirce谱支持相关猜想。

2022-07-19math.GTmath.QAmath.RA

Indecomposable racks of order p^2

We classify indecomposable racks of order p^2 (p a prime). There are 2p^2 - 2p - 2 isomorphism classes, among which 2p^2 - 3p - 1 correspond to quandles. In particular, we prove that an indecomposable quandle of order p^2 is affine (=Alexander). One of the results yielding this classification is the computation of the quandle nonabelian second cohomology group of an indecomposable quandle of prime order; which turns out to be trivial, as in the abelian case.

2002-03-15math.GTmath.QA

Symbolic computation with finite biquandles

A method of computing a basis for the second Yang-Baxter cohomology of a finite biquandle with coefficients in Q and Z_p from a matrix presentation of the finite biquandle is described. We also describe a method for computing the Yang-Baxter cocycle invariants of an oriented knot or link represented as a signed Gauss code. We provide a URL for our Maple implementations of these algorithms.

2007-09-02math.GTmath.QA

Exact Symbolic-Numeric Computation of Planar Algebraic Curves

We present a novel certified and complete algorithm to compute arrangements of real planar algebraic curves. It provides a geometric-topological analysis of the decomposition of the plane induced by a finite number of algebraic curves in terms of a cylindrical algebraic decomposition. From a high-level perspective, the overall method splits into two main subroutines, namely an algorithm denoted Bisolve to isolate the real solutions of a zero-dimensional bivariate system, and an algorithm denoted GeoTop to analyze a single algebraic curve. Compared to existing approaches based on elimination te…

2012-01-07cs.CGcs.MScs.SC