Related papers: Symbolic computation with finite quandles
Finding a Hadamard matrix (H-matrix) among the set of all binary matrices of corresponding order is a hard problem, which potentially can be solved by quantum computing. We propose a method to formulate the Hamiltonian of finding H-matrix…
In this paper, we study classes of structures and individual structures for which programs implementing functions defined everywhere are equivalent to finite tree-programs. The programs under consideration may have cycles and at most…
While the problem of knot classification is far from solved, it is possible to create computer programs that can be used to tabulate knots up to a desired degree of complexity. Here we discuss the main ideas on which such programs can be…
In this article, we discuss formal invariants of singularly-perturbed linear differential systems in neighborhood of turning points and give algorithms which allow their computation. The algorithms proposed are implemented in the computer…
A continuous cohomology theory for topological quandles is introduced, and compared to the algebraic theories. Extensions of topological quandles are studied with respect to continuous 2-cocycles, and used to show the differences in second…
The axioms of a quandle imply that the columns of its Cayley table are permutations. This paper studies quandles with exactly one non-trivially permuted column. Their automorphism groups, quandle polynomials, (symmetric) cohomology groups,…
Semigroup theory is a branch of abstract algebra, and it provides mathematical tools for the theory of computation. Finite semigroups can describe state transition systems and thus they model physically realizable computers. Engineering…
Cylindrical algebraic decomposition (CAD) is an important tool for the investigation of semi-algebraic sets, with applications within algebraic geometry and beyond. We recently reported on a new implementation of CAD in Maple which…
We restructure and advance the classification theory of finite racks and quandles by employing powerful methods from transformation groups and representation theory, especially Burnside rings. These rings serve as universal receptacles for…
We apply the singular sequence method to investigate the finiteness problem for stationary configurations of the planar N-vortex problem. The initial step of the singular sequence method involves identifying all two-colored diagrams. These…
Two finite Alexander quandles with the same number of elements are isomorphic iff their Z[t,t^-1]-submodules Im(1-t) are isomorphic as modules. This yields specific conditions on when Alexander quandles of the form Z_n[t,t^-1]/(t-a) where…
We define a family of quiver representation-valued invariants of oriented classical and virtual knots and links associated to a choice of finite quandle $X$, abelian group $A$, set of quandle 2-cocycles $C\subset H^2_Q(x;A)$, choice of…
Duality and chirality are examples of operations of order 2 on hypermaps. James showed that the groups of all operations on hypermaps and on oriented hypermaps can be identified with the outer automorphism groups ${\rm Out} \Delta\cong…
We describe an efficient algorithm to compute finite type invariants of type $k$ by first creating, for a given knot $K$ with $n$ crossings, a look-up table for all subdiagrams of $K$ of size $\lceil \frac{k}{2}\rceil$ indexed by dyadic…
In the last decade major steps towards an algorithmic treatment of orthogonal polynomials and special functions (OP & SF) have been made, notably Zeilberger's brilliant extension of Gosper's algorithm on algorithmic definite hypergeometric…
We prove that an Alexander quandle of prime order is generated by any pair of distinct elements. Furthermore, we prove for such a quandle that any ordered pair of distinct elements can be sent to any other such pair by an automorphism of…
In this paper we describe methods for computing rack and quandle cohomology. We illustrate these methods by completely determining the cohomology of prime dihedral quandles.
A quandle is an algebraic structure which attempts to generalize group conjugation. These structures have been studied extensively due to their connections with knot theory, algebraic combinatorics, and other fields. In this work, we…
The lower and upper bound of any given algorithm is one of the most crucial pieces of information needed when evaluating the computational effectiveness for said algorithm. Here a novel method of Boolean Algebraic Programming for symbolic…
This paper is devoted to qualgebras and squandles, which are quandles enriched with a compatible binary/unary operation. Algebraically, they are modeled after groups with conjugation and multiplication/squaring operations. Topologically,…