Related papers: Symbolic computation with finite quandles
We develop algorithms, implemented in Maple, that study the number of vertices with a particular number of children in a random ordered tree where all vertices must have a number of children in some finite set. By calculating the mixed…
Well-partial orders, and the ordinal invariants used to measure them, are relevant in set theory, program verification, proof theory and many other areas of computer science and mathematics. In this article we focus on one of the most…
Using specializations of unfold and fold on a generic tree data type we derive unranking and ranking functions providing natural number encodings for various Hereditarily Finite datatypes. In this context, we interpret unranking operations…
Quantum processes with indefinite causal structure emerge when we wonder which are the most general evolutions, allowed by quantum theory, of a set of local systems which are not assumed to be in any particular causal order. These processes…
An algorithm for quantum computing Hamiltonian cycles of simple, cubic, bipartite graphs is discussed. It is shown that it is possible to evolve a quantum computer into an entanglement of states which map onto the set of all possible paths…
Given a finite quandle, we introduce a quandle homotopy invariant of knotted surfaces in the 4-sphere, modifying that of classical links. This invariant is valued in the third homotopy group of the quandle space, and is universal among the…
Quandle representations are homomorphisms from a quandle to the group of invertible matrices on some vector space taken with the conjugation operation. We study certain families of quandle representations. More specifically, we introduce…
A quandle is a self-distributive algebraic structure that appears in quasi-group and knot theories. For each abelian group A and c \in A we define a quandle G(A, c) on \Z_3 \times A. These quandles are generalizations of a class of…
We consider the dimensions of finite type of representations of a partially ordered set, i.e. such that there is only finitely many isomorphism classes of representations of this dimension. We give a criterion for a dimension to be of…
This paper presents a computer program, written in Maple, that allows a user to simulate certain aspects of Shor's quantum factoring algorithm on a desktop or laptop computer. The program does not simulate the unitary operations carried out…
In the work are defined the concepts semi-canonical and canonical binary matrix. What is described is an algorithm solving the combinatorial problem for finding the semi-canonical matrices in the set \Lambda_n^k consisting of all n\times n…
A symmetric quandle is a quandle with a good involution. For a knot in \$R^3\$, a knotted surface in \$R^4\$ or an \$n\$-manifold knot in \$R^{n+2}\$, the knot symmetric quandle is defined. We introduce the notion of a symmetric quandle…
We study countable embedding-universal and homomorphism-universal structures and unify results related to both of these notions. We show that many universal and ultrahomogeneous structures allow a concise description (called here a finite…
We undertake the study of profinite quandles. We provide several constructions of profinite quandles from profinite groups, and from other profinite quandle. We characterize which subquandles of profinite quandles are again profinite.…
We introduce a novel approach to the automated termination analysis of computer programs: we use neural networks to represent ranking functions. Ranking functions map program states to values that are bounded from below and decrease as a…
Binomial Cayley graphs are obtained by considering the binomial coefficient of the weight function of a given Cayley graph and a natural number. We introduce these objects and study two families: one associated with symmetric groups and the…
A simple MATLAB implementation of hierarchical shape functions on 2D rectangles is explained and available for download. Global shape functions are ordered for a given polynomial degree according to the indices of the nodes, edges, or…
We classify rotary (orientably-regular) maps whose underlying graphs are multicycles. For the multicycle $\mathrm{C}_n^{(\lambda)}$ of length $n$ and edge-multiplicity $\lambda$, we determine all rotary embeddings for $n\geqslant 3$ and…
This paper is an exploration in a functional programming framework of {\em isomorphisms} between elementary data types (natural numbers, sets, multisets, finite functions, permutations binary decision diagrams, graphs, hypergraphs,…
We relate the singularities of a scheme $X$ to the asymptotics of the number of points of $X$ over finite rings. This gives a partial answer to a question of Mustata. We use this result to count representations of arithmetic lattices. More…