Related papers: Studying links via booklinks: A Markov theorem
This paper introduces a new algebra, the crossing algebra, that is applied to count the number of components for arborescent knots, links, tangles or states (of a state polynomial expansion such as the Kauffman bracket). This algebra is…
This paper is expository and is accessible to students. We define simple invariants of knots or links (linking number, Arf-Casson invariants and Alexander-Conway polynomials) motivated by interesting results whose statements are accessible…
We prove a prime decomposition theorem for string links in a thickened surface. Namely, we prove that any non-braid string link $\ell \subset \Sigma \times I$, where $\Sigma$ is a compact orientable (not necessarily closed) surface other…
We show that every canonically fibered link in $S^3$ is the binding of a braided open book in $S^3$, addressing a question of Montesinos and Morton. We introduce mutual arc presentations as our main technical tool, which we consider to be…
In this paper, we find a more straightforward problem that is equivalent to one of the major challenges in knot theory: the classification of links in the 3-sphere. More precisely, we provide a simpler braid description for all links in the…
We present a braid-theoretic approach to combinatorially computing knot Floer homology. To a knot or link K, which is braided about the standard disk open book decomposition for (S^3,\xi_std), we associate a corresponding multi-pointed nice…
We construct a Seifert surface for a given null-homologous transverse link in a contact manifold that is compatible with a planar open book decomposition, then obtain a formula of the self-linking number. It extends Bennequin's self-linking…
In this paper, we generalize the \textit{Clock Theorem} of Formal Knot Theory to knotoids in $S^2$. The clock theorem implies that clock states of a knotoid diagram form a lattice under transpositions. These states form the basis of many…
Every link in R^3 can be represented by a one-vertex ribbon graph. We prove a Markov type theorem on this subset of link diagrams.
There are many results asserting the existence of tree-decompositions of minimal width which still represent local connectivity properties of the underlying graph, perhaps the best-known being Thomas' theorem that proves for every graph $G$…
We present a short proof of the following Pontryagin theorem, whose original proof was complicated and has never been published in details: {\bf Theorem.} Let $M$ be a connected oriented closed smooth 3-manifold. Let $L_1(M)$ be the set of…
A companion paper to "On knot Floer homology in branched double covers" applied to braided branched loci. We reprove the main result of that paper concerning alternating branched loci when projected to an annulus, without using Khovanov…
We develop a calculus of surgery data, called bridged links, which involves besides links also pairs of balls that describe one-handle attachements. As opposed to the usual link calculi of Kirby and others this description uses only…
We investigate the local contribution of the braid monodromy factorization in the context of the links obtained by the closure of these braids. We consider plane curves which are arrangements of lines and conics as well as some algebraic…
We associate an open book with any connected plane checkerboard graph, thus providing a common extension of the classes of prime positive braid links and positive tree-like Hopf plumbings. As an application, we prove that the link type of a…
The classical Thistlethwaite theorem for links can be phrased as asserting that the Kauffman bracket of a link can be obtained from an evaluation of the Bollob\'as-Riordan polynomial of a ribbon graph associated to one of the link's…
We study four (a priori) different ways in which an open book decomposition of the 3-sphere can be defined to be braided. These include generalised exchangeability defined by Morton and Rampichini and mutual braiding defined by Rudolph,…
We prove Alexander- and Markov-type theorems for virtual spatial trivalent graphs and virtual trivalent braids. We provide two versions for the Markov-type theorem: one uses an algebraic approach similar to the case of classical braids and…
We give new decomposition theorems for classes of graphs that can be transduced in first-order logic from classes of sparse graphs -- more precisely, from classes of bounded expansion and from nowhere dense classes. In both cases, the…
We introduce the concept of tied links in the solid torus, which generalize naturally the concept of tied links in $S^3$ previously introduced by Aicardi and Juyumaya. We also define an invariant of these tied links by using skein…