English
Related papers

Related papers: On Free Knots

200 papers

As a generalization of a classical result on the Alexander polynomial for fibered knots, we show in this paper that the Reidemeister torsion associated to a certain representation detects fiberedness of knots in the three sphere.

Geometric Topology · Mathematics 2007-05-23 Hiroshi Goda , Teruaki Kitano , Takayuki Morifuji

We prove that if a finite order knot invariant does not distinguish mutant knots, then the corresponding weight system depends on the intersection graph of a chord diagram rather than on the diagram itself. The converse statement is easy…

Geometric Topology · Mathematics 2016-01-20 S. V. Chmutov , S. K. Lando

We generalize unoriented handlebody-links to the twisted virtual case, obtaining Reidemeister moves for handlebody-links in ambient spaces of the form $\Sigma\times [0,1]$ for $\Sigma$ a compact closed 2-manifold up to stable equivalence.…

Geometric Topology · Mathematics 2017-11-15 Sam Nelson , Yuqi Zhao

We introduce ribbon-moves of 2-knots, which are operations to make 2-knots into new 2-knots by local operations in B^4. (We do not assume the new knots is not equivalent to the old ones.) Let L_1 and L_2 be 2-links. Then the following hold.…

Geometric Topology · Mathematics 2007-05-23 Eiji Ogasa

By using parity arguments we prove that free knots are, generally, not invertible.

Geometric Topology · Mathematics 2009-09-18 Vassily Olegovich Manturov

Based on a recently introduced by the author notion of {\em parity}, in the present paper we construct a sequence of invariants (indexed by natural numbers $m$) of long virtual knots, valued in certain simply-defined group ${\tilde G}_{m}$…

Geometric Topology · Mathematics 2010-04-27 Vassily Olegovich Manturov

In this report, I will start by first giving a brief introduction on knots to build some intuition before beginning the more rigorous review in the Literature Review section. There, I will define knot equivalence, the Jones polynomial…

Geometric Topology · Mathematics 2022-02-15 Matthew Stevens

The motivation for this work is to construct a map from classical knots to virtual ones. What we get in the paper is a series of maps from knots in the full torus (thickened torus) to flat-virtual knots. We give definition of flat-virtual…

Geometric Topology · Mathematics 2024-06-21 V. O. Manturov , I. M. Nikonov

We start a systematic analysis of links up to 5-move equivalence. Our motivation is to develop tools which later can be used to study skein modules based on the skein relation being deformation of a 5-move (in an analogous way as the…

Geometric Topology · Mathematics 2007-12-07 Mieczyslaw K. Dabkowski , Makiko Ishiwata , Jozef H. Przytycki

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…

High Energy Physics - Theory · Physics 2008-02-03 Charilaos Aneziris

We build a notion of algebraic recognition for visibly pushdown languages by finite algebraic objects. These come with a typical Eilenberg relationship, now between classes of visibly pushdown languages and classes of finite algebras.…

Formal Languages and Automata Theory · Computer Science 2018-10-31 Silke Czarnetzki , Andreas Krebs , Klaus-Jörn Lange

We introduce \textit{Kaestner brackets}, a generalization of biquandle brackets to the case of parity biquandles. This infinite set of quantum enhancements of the biquandle counting invariant for oriented virtual knots and links includes…

Geometric Topology · Mathematics 2020-06-12 Forest Kobayashi , Sam Nelson

This paper gives new and elementary combinatorial topological proofs of the classification of unoriented and oriented rational knots and links. These proofs are based on the known classification of alternating knots through flyping, and the…

Geometric Topology · Mathematics 2007-05-23 Louis H. Kauffman , Sofia Lambropoulou

We describe an action of the concordance group of knots in the three-sphere on concordances of knots in arbitrary 3-manifolds. As an application we define the notion of almost-concordance between knots. After some basic results, we prove…

Geometric Topology · Mathematics 2018-03-07 Daniele Celoria

We state Bennequin inequalities in the relative case, and show that the relative invariants are additive under relative connected sums. We show they exhibit similar limitations as their classical analogues. We study relatively Legendrian…

Symplectic Geometry · Mathematics 2009-09-25 Georgi D. Gospodinov

We examine free orientation-reversing group actions on orientable handlebodies, and free actions on nonorientable handlebodies. A classification theorem is obtained, giving the equivalence classes and weak equivalence classes of free…

Geometric Topology · Mathematics 2007-05-23 Antonio F. Costa , Darryl McCullough

These notes are based on the lectures given by the author during Winter Braids IX in Reims in March 2019. We discuss slice knots and why they are interesting, as well as some ways to decide if a given knot is or is not slice. We describe…

Geometric Topology · Mathematics 2022-01-24 Brendan Owens

We construct an algorithm to decide whether two given Legendrian or transverse links are equivalent. In general, the complexity of the algorithm is too high for practical implementation. However, in many cases, when the symmetry group of…

Geometric Topology · Mathematics 2023-09-12 Ivan Dynnikov , Maxim Prasolov

Two natural generalizations of knot theory are the study of spatially embedded graphs, and Kauffman's theory of virtual knots. In this paper we combine these approaches to begin the study of virtual spatial graphs.

Geometric Topology · Mathematics 2009-01-10 Thomas Fleming , Blake Mellor

We explore the application of automated reasoning techniques to unknot detection, a classical problem of computational topology. We adopt a two-pronged experimental approach, using a theorem prover to try to establish a positive result…

Logic in Computer Science · Computer Science 2014-05-19 Andrew Fish , Alexei Lisitsa