Related papers: Matrices and finite Alexander quandles
We define a two-variable polynomial invariant of finite quandles. In many cases this invariant completely determines the algebraic structure of the quandle up to isomorphism. We use this polynomial to define a family of link invariants…
Cocycles are constructed by polynomial expressions for Alexander quandles. As applications, non-triviality of some quandle homology groups are proved, and quandle cocycle invariants of knots are studied. In particular, for an infinite…
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…
A tangle is an oriented 1-submanifold of the cylinder whose endpoints lie on the two disks in the boundary of the cylinder. Using an algebraic tool developed by Lescop, we extend the Burau representation of braids to a functor from the…
An Alexandroff space is a topological space in which every intersection of open sets is open. There is one to one correspondence between Alexandroff $T_0$-spaces and partially ordered sets (posets). We investigate Alexandroff…
A quandle is an algebra whose axioms are motivated from knot theory. A linear extension of a quandle can be described by using a pair of maps called an Alexander pair. In this paper, we show that a linear extension of a multiple conjugation…
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.…
Let $K$ be a number field, let $A$ be a finite-dimensional $K$-algebra, let $\mathrm{J}(A)$ denote the Jacobson radical of $A$, and let $\Lambda$ be an $\mathcal{O}_{K}$-order in $A$. Suppose that each simple component of the semisimple…
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…
We describe isomorphisms of groups of several periodic infinite matrices and isomorphisms of groups of invertible elements of unital locally matrix algebras.
In this paper we look for closed expressions to calculate the number of colourings of prime knots for given linear Alexander quandles. For this purpose the colouring matrices are simplified to a triangular form, when possible. The…
Let X and Y be curves over a finite field. In this article we explore methods to determine whether there is a rational map from Y to X by considering L-functions of certain covers of X and Y and propose a specific family of covers to…
Finite difference schemes are here solved by means of a linear matrix equation. The theoretical study of the related algebraic system is exposed, and enables us to minimize the error due to a finite difference approximation.
We show that the lower bounds for Betti numbers given in math.GT/9909161 are equalities for a class of racks that includes dihedral and Alexander racks. We confirm a conjecture from the same paper by defining a splitting for the short exact…
Quandle is an algebraic system with one binary operation, but it is quite different from a group. Quandle has its origin in the knot theory and good relationships with the theory of symmetric spaces, so it is well-studied from points of…
Let K be a number field, let A be a finite dimensional semisimple K-algebra and let Lambda be an O_K-order in A. It was shown in previous work that, under certain hypotheses on A, there exists an algorithm that for a given (left)…
This is a tutorial for using a new q-series Maple package. The package includes facilities for conversion between q-series and q-products and finding algebraic relations between q-series. Andrews found an algorithm for converting a q-series…
We present a new algorithm to decide finiteness of matrix groups defined over a field of positive characteristic. Together with previous work for groups in zero characteristic, this provides the first complete solution of the finiteness…
We present a characterisation of blenders based on mapping properties of certain sets of curves that can be rigorously verified by computer-assisted methods. We develop an algorithm to construct these sets of curves that requires only a…
In this paper, we propose an incremental algorithm for computing cylindrical algebraic decompositions. The algorithm consists of two parts: computing a complex cylindrical tree and refining this complex tree into a cylindrical tree in real…