Related papers: Symbolic computation with finite quandles
We are concerned with the arithmetic of solutions to ordinary or partial nonlinear differential equations which are algebraic in the indeterminates and their derivatives. We call these solutions D-algebraic functions, and their equations…
In this paper, we study quandles of cyclic type, which form a particular subclass of finite quandles. The main result of this paper describes the set of isomorphism classes of quandles of cyclic type in terms of certain cyclic permutations.…
In CJKLS quandle cohomology is used to produce invariants for particular embeddings of codimension two; 2-cocycles give to invariants for (classical) knots and 3-cocycles give rise to invariants for knotted surfaces. This is done by way of…
This work deals with the definability problem by quantifier-free first-order formulas over a finite algebraic structure. We show the problem to be coNP-complete and present two decision algorithms based on a semantical characterization of…
We define a quandle variety as an irreducible algebraic variety $Q$ endowed with an algebraically defined quandle operation $\rhd$. It can also be seen as an analogue of a generalized affine symmetric space or a regular $s$-manifold in…
We propound the thesis that there is a limitation to the number of possible structures which are axiomatically endowed with identities involving operations. In the case of algebras with a binary operation satisfying a formally reducible (to…
Take a multiplicative monoid of sequences in which the multiplication is given by Hadamard product. The set of linear combinations of interleaving monoid elements then yields a ring. For hypergeometric sequences, the resulting ring is a…
This is a report on our ongoing research on a combinatorial approach to knot recognition, using coloring of knots by certain algebraic objects called quandles. The aim of the paper is to summarize the mathematical theory of knot coloring in…
Given a quandle, we can construct a symmetric quandle called the symmetric double of the quandle. We show that the (co)homology groups of a given quandle are isomorphic to those of its symmetric double. Moreover, quandle coloring numbers…
We establish a canonical correspondence between connected quandles and certain configurations in transitive groups, called quandle envelopes. This correspondence allows us to efficiently enumerate connected quandles of small orders, and…
We are intereseted in quandles and their enveloping groups. Various results are proven. We show that a quandle $Q$ and its image in the enveloping group $G(Q)$ have isomorphic enveloping groups. The image quandle is injective. For $Q$ a…
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…
We present a uniform methodology for computing with finitely generated matrix groups over any infinite field. As one application, we completely solve the problem of deciding finiteness in this class of groups. We also present an algorithm…
We present algorithms for computation and visualization of amoebas, their contours, compactified amoebas and sections of three-dimensional amoebas by two-dimensional planes. We also provide method and an algorithm for the computation…
Over the last decades, deep neural networks based-models became the dominant paradigm in machine learning. Further, the use of artificial neural networks in symbolic learning has been seen as increasingly relevant recently. To study the…
Cohomology operations (including the cohomology ring) of a geometric object are finer algebraic invariants than the homology of it. In the literature, there exist various algorithms for computing the homology groups of simplicial complexes…
We study the structure of symplectic quandles, quandles which are also R-modules equipped with an antisymmetric bilinear form. We show that every finite dimensional symplectic quandle over a finite field F or arbitrary field F of…
We consider the problem of minimizing a linear function over an affine section of the cone of positive semidefinite matrices, with the additional constraint that the feasible matrix has prescribed rank. When the rank constraint is active,…
The concept of a universal algorithm is discussed. Examples of this kind of algorithms are presented. Software implementations of such algorithms in C++ type languages are discussed together with means that provide for computations with an…
Let $A$ be a finite ordered set. Define the ordered set $A^A$ as the set of all maps from $A$ to $A$, ordered pointwise. Let ${}^{A} A$ be the dual of $A^A$. We prove results in the spirit of Parts~I--III, but now using both $A^A$ and…