arXiv 0709.44652007-09-27math.GT

Exchange moves and Fiedler polynomial

Radu Popescu

英文摘要：

In order to obtain a Markov theorem without stabilization, Birman and Menasco introduced the notion of exchange related braids. In this paper I study the way the Fiedler polynomial distinguishes conjugacy classes of some particular braided knots. I introduce the Kauffman bracket in the solid torus. Its Taylor expansion give finite type invariants similar to the Fiedler polynomial. I investigate how these invariants distinguish exchange related braids.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Exchange moves and braid representations of links

We prove that under fairly general conditions an iterated exchange move gives infinitely many non-conjugate braids. As a consequence, every knot has infinitely many conjugacy classes of n-braid representations if and only if it has one admitting an exchange move.

2011-03-13math.GT

A non-degenerate exchange move always produces infinitely many non-conjugate braids

We show that if a link $L$ has a closed $n$-braid representative admitting non-degenerate exchange move, an exchange move that does not obviously preserve the conjugacy class, $L$ has infinitely many non-conjugate closed $n$-braid representatives.

2019-08-05math.GT

Realizing Exterior Cromwell moves on rectangular diagrams by Reidemeister moves

If a rectangular diagram represents the trivial knot, then it can be deformed into the trivial rectangular diagram with only four edges by a finite sequence of merge operations and exchange operations, without increasing the number of edges, which was shown by I. A. Dynnikov. Using this, Henrich and Kauffman gave an upper bound for the number of Reidemeister moves needed for unknotting a knot diagram of the trivial knot. However, exchange or merge moves on the top and bottom pairs of edges of rectangular diagrams are not considered in the proof. In this paper, we show that there is a rectangul…

2014-03-02math.GT

Recognizing destabilization, exchange moves and flypes

The Markov Theorem Without Stabilization (MTWS) established the existence of a calculus of braid isotopies that can be used to move between closed braid representatives of a given oriented link type without having to increase the braid index by stabilization. Although the calculus is extensive there are three key isotopies that were identified and analyzed---destabilization, exchange moves and elementary braid preserving flypes. One of the critical open problems left in the wake of the MTWS is the "recognition problem"---determining when a given closed $n$-braid admits a specified move of the …

2012-01-26math.GNmath.GT

Monotonic Simplification and Recognizing Exchange Reducibility

The Markov Theorem Without Stabilization (MTWS) (see math.GT/0310279) established the existence of a calculus of braid isotopies that can be used to move between closed braid representatives of a given oriented link type without having to increase the braid index by stabilization. Although the calculus is extensive there are three key isotopies that were identified and analyzed--destabilization, exchange moves and elementary braid preserving flypes. One of the critical open problems left in the wake of the MTWS is the "recognition problem"--determining when a given closed n-braid admits a spec…

2012-01-26math.GNmath.GT

Operations on open book foliations

We study b-arc foliation change and exchange move of open book foliations which generalize the corresponding operations in braid foliation theory. We also define a bypass move as an analogue of Honda's bypass attachment operation. As applications, we study how open book foliations change under a stabilization of the open book. We also generalize Birman-Menasco's split/composite braid theorem: Closed braid representatives of a split (resp. composite) link in a certain open book can be converted to a split (resp. composite) closed braid by applying exchange moves finitely many times.

2013-09-17math.GT

更多相关论文收起更多论文

Obstructions to trivializing a knot

The recent proof by Bigelow and Krammer that the braid groups are linear opens the possibility of applications to the study of knots and links. It was proved by the first author and Menasco that any closed braid representative of the unknot can be systematically simplified to a round planar circle by a sequence of exchange moves and reducing moves. In this paper we establish connections between the faithfulness of the Krammer-Lawrence representation and the problem of recognizing when the conjugacy class of a closed braid admits an exchange move or a reducing move.

2003-10-18math.GRmath.GT

On iterated torus knots and transversal knots

A knot type is exchange reducible if an arbitrary closed n-braid representative can be changed to a closed braid of minimum braid index by a finite sequence of braid isotopies, exchange moves and +/- destabilizations. In the manuscript [J Birman and NC Wrinkle, On transversally simple knots, preprint (1999)] a transversal knot in the standard contact structure for S^3 is defined to be transversally simple if it is characterized up to transversal isotopy by its topological knot type and its self-linking number. Theorem 2 of Birman and Wrinkle [op cit] establishes that exchange reducibility impl…

2001-09-15math.DSmath.GT