Related papers: Unknotted cycles
Consider a robot that remembers only the starting position and walks along a knot once on a knot diagram, switching every undercrossing it meets until it returns to the starting position. We observe that the robot produces an ascending…
We give a brief survey of some known results on intrinsically linked or knotted graphs.
We construct a new order 1 invariant for knot diagrams. We use it to determine the minimal number of Reidemeister moves needed to pass between certain pairs of knot diagrams.
We prove that any link admitting a diagram with a single negative crossing is strongly quasipositive. This answers a question of Stoimenow's in the (strong) positive. As a second main result, we give simple and complete characterizations of…
A gordian unlink is a finite number of unknots that are not topologically linked, each with prescribed length and thickness, and that cannot be disentangled into the trivial link by an isotopy preserving length and thickness throughout. In…
The unknotting number of knots is a difficult quantity to compute, and even its behavior under basic satelliting operations is not understood. We establish a lower bound on the unknotting number of cable knots and iterated cable knots…
Using a result of Gessel and Reutenauer, we find a simple formula for the number of cyclic permutations with a given descent set, by expressing it in terms of ordinary descent numbers (i.e., those counting all permutations with a given…
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…
We analyse the structure of equivalence classes of symmetric quivers whose generating series are equal. We consider such classes constructed using the basic operation of unlinking, which increases a size of a quiver. The existence and…
We make connections of a counting problem of Eulerian cycles for undirected graphs to homological spectral graph theory, and formulate explicitly a trace formula that identifies the number of Eulerian circuits on an Eulerian graph with the…
Building further on work of Marin and Wagner, we give a cubic braid-type skein theory of the Links--Gould polynomial invariant of oriented links and prove that it can be used to evaluate any oriented link, adding this polynomial to the list…
A knot invariant is called skein if it is determined by a finite number of skein relations. In the paper we discuss some basic properties of skein invariants and mention some known examples of skein invariants.
In this paper we present a sequence of link invariants, defined from twisted Alexander polynomials, and discuss their effectiveness in distinguish knots. In particular, we recast and extend by geometric means a recent result of Silver and…
We study the gordian graph of all knots in $\R^3$: two knots are adjacent if they differ by a single crossing change. We prove that this graph contains isometrically an infinite countable tree with infinite valency, and that the complement…
A classical enumerative result states that, given a graph $G$ and a vertex $u$, the number of connected subgraphs of $G$ is equal to the number of orientations of $G$ such that every vertex can reach $u$ by a directed path. We show that…
In paper "A new twist on Lorenz links" (Journal of Topology 2(2009), 227-248) Joan Birman and Ilya Kofman prove the coincidence of the class of Lorenz links and the class of twisted links. The proof in that work is algebraic. We will…
We consider a model of random permutations of the sites of the cubic lattice. Permutations are weighted so that sites are preferably sent onto neighbors. We present numerical evidence for the occurrence of a transition to a phase with…
A permutation of [n] induces a graph on [n] such that the edges of the graph correspond to inversion pairs of the permutation. This graph is connected if and only if the corresponding permutation is indecomposable. Let s(n,m) denote a…
We introduce a simple combinatorial method for computing all versions of the knot Floer homology of the preimage of a two-bridge knot K(p,q) inside its double-branched cover, -L(p,q). The 4-pointed genus 1 Heegaard diagram we obtain looks…
Using a Heegaard diagram for the pullback of a knot $K \subset S^3$ in its cyclic branched cover $\Sigma_m(K)$ obtained from a grid diagram for $K$, we give a combinatorial proof for the invariance of the associated combinatorial knot Floer…