Related papers: Low complexity algorithms in knot theory

The concordance orders of many algebraic order two knots of ten or fewer crossings have been heretofore unknown. We use Casson-Gordon invariants and twisted Alexander polynomials to find that, in all but one case, these knots do not have…

A powerful way to study groups is via their actions on suitable spaces. Classifying spaces for families of subgroups are a type of these spaces, obtained by imposing some strict conditions on the fixed-point sets. We show how in the…

Binary representations of the trefoil and other knots of up to ten crossings in the simple cubic lattice were created. The BiEntropy of each knot was computed using a variety of binary encodings and compared against controls. This showed…

Knots, links and entangled filaments appear in many physical systems of interest in biology and engineering. Classifying knots and measuring entanglement is of interest both for advancing knot theory, as well as for analyzing large data…

This thesis develops some general calculational techniques for finding the orders of knots in the topological concordance group C. The techniques currently available in the literature are either too theoretical, applying to only a small…

We classify all knot diagrams of genus two and three, and give applications to positive, alternating and homogeneous knots, including a classification of achiral genus 2 alternating knots, slice or achiral 2-almost positive knots, a proof…

Ropelength and embedding thickness are related measures of geometric complexity of classical knots and links in Euclidean space. In their recent work, Freedman and Krushkal posed a question regarding lower bounds for embedding thickness of…

Algorithm of construction of all knots, links with given number of crosses on diagram of knot, link is offered. This algorithm is based on simple proposition, that there is a representation of knot (link) as closure of braid with n threads…

A {\it stuck knot} is a knot diagram containing designated crossings, called {\it stuck crossings}, whose incident strands are required to remain locally non-separable. These rigidity constraints restrict the allowable ambient isotopies and…

The list of knots with up to 10 crossings is commonly referred to as the Rolfsen Table. This paper presents a way to generate the Rolfsen table in a simple, clear, and reproducible manner. The methods we use are similar to those used by J.…

Knots have a twisted history in quantum physics. They were abandoned as failed models of atoms. Only much later was the connection between knot invariants and Wilson loops in topological quantum field theory discovered. Here we show that…

We discuss the possibility of the existence of finite algorithms that may give distinct knot classes. In particular we present two attempts for such algorithms which seem promising, one based on knot projections on a plane, the other on…

Kearton observed that mutation can change the concordance class of a knot. A close examination of his example reveals that it is of 4-genus 1 and has a mutant of 4-genus 0. The first goal of this paper is to construct examples to show that…

Two fundamental objects in knot theory are the minimal genus surface and the least area surface bounded by a knot in a 3-dimensional manifold. When the knot is embedded in a general 3-manifold, the problems of finding these surfaces were…

We consider the NP-hard Tree Containment problem that has important applications in phylogenetics. The problem asks if a given leaf-labeled network contains a subdivision of a given leaf-labeled tree. We develop a fast algorithm for the…

A knot K is called n-adjacent to another knot K', if K admits a projection containing n generalized crossings such that changing any 0 < m \leq n of them yields a projection of K'. We apply techniques from the theory of sutured 3-manifolds,…

A conjecture proposed by J. Tripp in 2002 states that the crossing number of any knot coincides with the canonical genus of its Whitehead double. In the meantime, it has been established that this conjecture is true for a large class of…

A knot is a closed loop in space without self-intersection. Two knots are equivalent if there is a self homeomorphism of space bringing one onto the other. An arc presentation is an embedding of a knot in the union of finitely many half…

We prove that if the order of the first homology of the 2-fold branched cover of a knot K in the 3-sphere is given by pm where p is a prime congruent to 3 mod 4 and gcd(p,m) =1, then K is of infinite order in the knot concordance group.…

The worst-case complexity of group-theoretic algorithms has been studied for a long time. Generic-case complexity, or complexity on random inputs, was introduced and studied relatively recently. In this paper, we address the average-case…