English
Related papers

Related papers: Everywhere Equivalent 3-Braids

200 papers

We introduce a notion of "quasi-right-veering" for closed braids, which plays an analogous role to "right-veering" for open books. We show that a transverse link $K$ in a contact 3-manifold $(M,\xi)$ is non-loose if and only if every braid…

Geometric Topology · Mathematics 2018-07-13 Tetsuya Ito , Keiko Kawamuro

By a fixed continuous map from a $3$-space to itself, a knot in the $3$-space may be mapped to another knot in the $3$-space. We analyze possible knot types of them. Then we map a knot repeatedly by a fixed continuous map and analyze…

Geometric Topology · Mathematics 2014-09-04 Kouki Taniyama

A generic immersion of a planar graph into the 2-space is said to be knotted if there does not exist a trivial embedding of the graph into the 3-space obtained by lifting the immersion with respect to the natural projection from the 3-space…

Geometric Topology · Mathematics 2020-05-19 Youngsik Huh , Ryo Nikkuni

A quasiconformal tree $T$ is a (compact) metric tree that is doubling and of bounded turning. We call $T$ trivalent if every branch point of $T$ has exactly three branches. If the set of branch points is uniformly relatively separated and…

Complex Variables · Mathematics 2020-04-20 Mario Bonk , Daniel Meyer

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…

Geometric Topology · Mathematics 2022-09-05 Peter Feller , Lukas Lewark , Andrew Lobb

We prove that there is a knot $K$ transverse to $\xi_{std}$, the tight contact structure of $S^3$, such that every contact 3-manifold $(M, \xi)$ can be obtained as a contact covering branched along $K$. By contact covering we mean a map…

Geometric Topology · Mathematics 2022-11-02 Jesús Rodríguez-Viorato

Given a diagram $D$ of a knot $K$, we consider the number $c(D)$ of crossings and the number $b(D)$ of overpasses of $D$. We show that, if $D$ is a diagram of a nontrivial knot $K$ whose number $c(D)$ of crossings is minimal, then…

Geometric Topology · Mathematics 2009-11-10 Jae-Wook Chung , Xiao-Song Lin

In this paper, a regional knot invariant is constructed. Like the Wirtinger presentation of a knot group, each planar region contributes a generator, and each crossing contributes a relation. The invariant is call a tridle of the link. As…

Geometric Topology · Mathematics 2017-03-20 Zhiqing Yang

We define an equivalence relation on graphs with signed edges, such that the associated adjacency matrices of two equivalent graphs are congruent over $\mathbb{Z}$. We show that signed graphs whose eigenvalues are larger than $-2$ are…

Geometric Topology · Mathematics 2019-07-25 Lucas Fernandez Vilanova

We prove that a graph is intrinsically linked in an arbitrary 3-manifold M if and only if it is intrinsically linked in S^3. Also, assuming the Poincare Conjecture, we prove that a graph is intrinsically knotted in M if and only if it is…

Geometric Topology · Mathematics 2009-04-17 Erica Flapan , Hugh Howards , Don Lawrence , Blake Mellor

A symmetric quandle is a quandle with a good involution. For a knot in \$R^3\$, a knotted surface in \$R^4\$ or an \$n\$-manifold knot in \$R^{n+2}\$, the knot symmetric quandle is defined. We introduce the notion of a symmetric quandle…

Geometric Topology · Mathematics 2016-01-06 Seiichi Kamada

A rational link may be represented by any of the (infinitely) many link diagrams corresponding to various continued fraction expansions of the same rational number. The continued fraction expansion of the rational number in which all signs…

General Topology · Mathematics 2019-08-27 Yuanan Diao , Claus Ernst , Gabor Hetyei

Barnette's Conjecture claims that all cubic, 3-connected, planar, bipartite graphs are Hamiltonian. We give a translation of this conjecture into the matching-theoretic setting. This allows us to relax the requirement of planarity to give…

Combinatorics · Mathematics 2022-08-17 Maximilian Gorsky , Raphael Steiner , Sebastian Wiederrecht

A knot $K$ is called $n$-adjacent to a knot $K'$ if there is a set of $n$ crossing circles $\mathcal C$ in $K$ so that a generalized crossing change at any nonempty subset of crossings in $\mathcal C$ yields $K'$. In this paper, the authors…

Geometric Topology · Mathematics 2026-05-11 Marion Campisi , Brandy Doleshal , Eric Staron

A string diagram is a two-dimensional graphical representation that can be described as a one-dimensional term generated from a set of primitives using sequential and parallel compositions. Since different syntactic terms may represent the…

Logic in Computer Science · Computer Science 2026-02-12 Julie Cailler , Noé Delorme , Simon Perdrix , Sophie Tourret

A knot K is called n-adjacent to the unknot, if K admits a projection containing n generalized crossings such that changing any m (no larger than n) of them yields a projection of the unknot. We show that a non-trivial satellite knot K is…

Geometric Topology · Mathematics 2007-05-23 Efstratia Kalfagianni , Xiao-Song Lin

This paper is a survey on the theory of knotoids and braidoids. Knotoids are open ended knot diagrams in surfaces and braidoids are geometric objects analogous to classical braids, forming a counterpart theory to the theory of knotoids in…

Geometric Topology · Mathematics 2019-03-06 Neslihan Gügümcü , Louis H. Kauffman , Sofia Lambropoulou

In this study of the Reidemeister moves within the classical knot theory, we focus on hard diagrams of knots and links, categorizing them as either rigid or shaky based on their adaptability to certain moves. We establish that every link…

Geometric Topology · Mathematics 2025-10-14 Michal Jablonowski

In this paper, we prove that region crossing change on a link diagram is an unknotting operation if and only if the link is proper. A description of the behavior of region crossing change on link diagrams is given. Furthermore we also…

Geometric Topology · Mathematics 2015-06-03 Zhiyun Cheng

Switches are operations which make local changes to the edges of a graph, usually with the aim of preserving the vertex degrees. We study a restricted set of switches, called triangle switches. Each triangle switch creates or deletes at…

Combinatorics · Mathematics 2021-07-28 Colin Cooper , Martin Dyer , Catherine Greenhill