SearcharxivSearch

arXiv subjects

Sam Nelson

Publications and source records attributed to Sam Nelson.

At least 109 records · Page 6Linked to original sources

The 2-generalized knot group determines the knot

Generalized knot groups $G_n(K)$ were introduced independently by Kelly (1991) and Wada (1992). We prove that $G_2(K)$ determines the unoriented knot type and sketch a proof of the same for $G_n(K)$ for $n>2$.

math.GT

Virtual Yang-Baxter cocycle invariants

We extend the Yang-Baxter cocycle invariants for virtual knots by augmenting Yang-Baxter 2-cocycles with cocycles from a cohomology theory associated to a virtual biquandle structure. These invariants coincide with the classical Yang-Baxter cocycle invariants for classical knots but provide extra information about virtual knots and links. In particular, they provide a method for detecting non-classicality of virtual knots and links.

math.GT

On bilinear biquandles

We define a type of biquandle which is a generalization of symplectic quandles. We use the extra structure of these bilinear biquandles to define new knot and link invariants and give some examples.

math.QA

An isomorphism theorem for Alexander biquandles

We show that two Alexander biquandles M and M' are isomorphic iff there is an isomorphism of Z[s,1/s,t,1/t]-modules h:(1-st)M --> (1-st)M' and a bijection g:O_s(A) --> O_s(A') between the s-orbits of sets of coset representatives of M/(1-st)M and M'/(1-st)M' respectively satisfying certain compatibility conditions.

math.QA

Quandles and Linking Number

We study the quandle counting invariant for a certain family of finite quandles with trivial orbit subquandles. We show how these invariants determine the linking number of classical two-component links up to sign.

math.GT

On symplectic quandles

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 characteristic other than 2 is a disjoint union of a trivial quandle and a connected quandle. We use the module structure of a symplectic quandle over a finite ring to refine and strengthen the quandle counting invariant.

math.QA

Symbolic computation with finite biquandles

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 Yang-Baxter cocycle invariants of an oriented knot or link represented as a signed Gauss code. We provide a URL for our Maple implementations of these algorithms.

math.GT

A polynomial invariant of finite 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 which generalize the quandle counting invariant.

math.QA

On Generalized Knot Groups

Generalized knot groups G_n(K) were introduced first by Wada and Kelly independently. The classical knot group is the first one G_1(K) in this series of finitely presented groups. For each natural number n, G_1(K) is a subgroup of G_n(K) so the generalized knot groups can be thought of as extensions of the classical knot group. For the square knot SK and the granny knot GK, we have an isomorphism $G_1(SK)\cong G_1(GK)$. From the presentations of G_n(SK) and G_n(GK), for n>1, it seems unlikely that G_n(SK) and G_n(GK) would be isomorphic to each other. We are able to show that for many finite groups H, the numbers of homomorphisms from G_n(SK) and G_n(GK) to H, respectively, are the same. Moreover, the numbers of conjugacy classes of homomorphisms from G_n(SK) and G_n(GK) to H, respectively, are also the same. It remains a challenge to us to show, as we would like to conjecture, that G_n(SK) and G_n(GK) are not isomorphic to each other for all n>1.

math.GT

Alexander quandles of order 16

Isomorphism classes of Alexander quandles of order 16 are determined, and classes of connected quandles are identified. This paper extends the list of known distinct connected finite Alexander quandles.

math.GT

On the Orbit Decomposition of Finite Quandles

We study the structure of finite quandles in terms of subquandles. Every finite quandle $Q$ decomposes in a natural way as a union of disjoint $Q$-complemented subquandles; this decomposition coincides with the usual orbit decomposition of $Q$. Conversely, the structure of a finite quandle with a given orbit decomposition is determined by its structure maps. We describe a procedure for finding all non-connected quandle structures on a disjoint union of subquandles.

math.GT

Non-classicality and quandle difference invariants

Non-classical virtual knots may have non-isomorphic upper and lower quandles. We exploit this property to define the quandle difference invariant, which can detect non-classicality by comparing the numbers of homomorphisms into a finite quandle from a virtual knot's upper and lower quandles. The invariants for small-order finite quandles detect non-classicality in several interesting virtual knots. We compute the difference invariant with the six smallest connected quandles for all non-evenly intersticed Gauss codes with 3 and 4 crossings. For non-evenly intersticed Gauss codes with 4 crossings, the difference invariant detects non-classicality in 86% of codes which have non-trivial upper or lower counting invariant values.

math.GT

Symbolic computation with finite quandles

Algorithms are described and Maple implementations are provided for finding all quandles of order $n$, as well as computing all homomorphisms between two finite quandles or from a finitely presented quandle (e.g., a knot quandle) to a finite quandle, computing the automorphism group of a finite quandle, etc. Several of these programs work for arbitrary binary operation tables and hence algebraic structures other than quandles. We also include a stand-alone C program which finds quandles of order $n$ and provide URLs for files containing the results for $n=6,$ 7 and 8.

math.GT

Matrices and finite Alexander quandles

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.

math.GT

Matrices and Finite Biquandles

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 reveal information not present in the knot quandle, such as the non-triviality of the virtual trefoil and various Kishino knots. We also exhibit a virtual knot which is distinguished from its obverse and its reverse by a finite biquandle counting invariant. We classify biquandles of order 2, 3 and 4 and provide a URL for our Maple programs for computing with finite biquandles.

math.GT

Matrices and Finite Quandles

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 of each finite quandle. As an application, we classify finite quandles with up to 5 elements and compute the automorphism group for each quandle.

math.GT

Signed ordered knotlike quandle presentations

We define enhanced presentations of quandles via generators and relations with additional information comprising signed operations and an order structure on the set of generators. Such a presentation determines a virtual link diagram up to virtual moves. We list formal Reidemeister moves in which Tietze moves on the presented quandle are accompanied by corresponding changes to the order structure. Omitting the order structure corresponds to replacing virtual isotopy by welded isotopy.

math.GT

Virtual Crossing Realization

We study virtual isotopy sequences with classical initial and final diagrams, asking when such a sequence can be changed into a classical isotopy sequence by replacing virtual crossings with classical crossings. An example of a sequence for which no such virtual crossing realization exists is given. A conjecture on conditions for realizability of virtual isotopy sequences is proposed, and a sufficient condition for realizability is found. The conjecture is reformulated in terms of 2-knots and knots in thickened surfaces.

math.GT