Related papers: Symbolic computation with finite 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…
Finite quandles with n elements can be represented as n-by-n matrices. We show how to use these matrices to distinguish all isomorphism classes of finite quandles for a given cardinality n, as well as how to compute the automorphism group…
We describe an algorithm for determining whether a finite quandle is isomorphic to an Alexander quandle by finding all possible Alexander presentations of the quandle. We give an implementation of this algorithm in Maple.
We introduce a notion of natural orderings of elements of finite connected quandles of order $n$. When the elements of such a quandle $Q$ are already ordered naturally, any automophism on $Q$ is a natural ordering. Although there are many…
We describe a way of representing finite biquandles with n elements as 2n x 2n block matrices. Any finite biquandle defines an invariant of virtual knots through counting homomorphisms. The counting invariants of non-quandle biquandles can…
The finite topological quandles can be represented as $n\times n$ matrices, recently defined by S. Nelson and C. Wong. In this paper, we first study the finite topological quandles and we show how to use these matrices to distinguish all…
We give a complete description of the associated group of any quandle as a central extension of the inner-automorphism group. As an application, we compute the second quandle homology groups of quandles of some families, including those of…
Many interesting and useful symbolic computation algorithms manipulate mathematical expressions in mathematically meaningful ways. Although these algorithms are commonplace in computer algebra systems, they can be surprisingly difficult to…
Virtual racks and virtual quandles are nonassociative algebraic structures based on the Reidemeister moves of virtual knots. In this note, we enumerate virtual dihedral quandles and several families of virtual permutation racks and virtual…
Symbolic computation, powered by modern computer algebra systems, has important applications in mathematical reasoning through exact deep computations. The efficiency of symbolic computation is largely constrained by such deep computations…
We investigate finite right-distributive binary algebraic structures called shelves. We first use symbolic computations with Python to classify (up to isomorphism) all connected shelves with order less than six. We explore the group…
A rack of order $n$ is a binary operation $\rack$ on a set $X$ of cardinality $n$, such that right multiplication is an automorphism. More precisely, $(X,\rack)$ is a rack provided that the map $x\mapsto x\rack y$ is a bijection for all…
The cohomology ring of a finite group, with coefficients in a finite field, can be computed by a machine, as Carlson has showed. Here "compute" means to find a presentation in terms of generators and relations, and involves only the…
We present different methods for symbolic computer algebra computations in higher dimensional (\ge9) Clifford algebras using the \Clifford\ and \Bigebra\ packages for \Maple(R). This is achieved using graded tensor decompositions,…
Quandles are self-distributive, right-invertible, idempotent algebras. A group with conjugation for binary operation is an example of a quandle. Given a quandle $(Q, \ast)$ and a positive integer $n$, define $a\ast_n b = (\cdots (a\ast…
These course notes are about computing modular forms and some of their arithmetic properties. Their aim is to explain and prove the modular symbols algorithm in as elementary and as explicit terms as possible, and to enable the devoted…
We provide algorithms for symbolic integration of hyperlogarithms multiplied by rational functions, which also include multiple polylogarithms when their arguments are rational functions. These algorithms are implemented in Maple and we…
This paper focuses on the derivations and automorphism groups of certain finite-dimensional associative algebras over the field of complex numbers. Using classification results for algebras of dimensions two, three, and four, along with…
We construct tree-decompositions of graphs that distinguish all their k-blocks and tangles of order k, for any fixed integer k. We describe a family of algorithms to construct such decompositions, seeking to maximize their diversity subject…
Recent algorithmic advances in algebraic automata theory drew attention to semigroupoids (semicategories). These are mathematical descriptions of typed computational processes, but they have not been studied systematically in the context of…