中文
相关论文

相关论文: The Braid Index Of Reduced Alternating Links

200 篇论文

It is well known that the braid index of a link equals the minimum number of Seifert circles among all link diagrams representing it. For a link with a reduced alternating diagram $D$, $s(D)$, the number of Seifert circles in $D$, equals…

几何拓扑 · 数学 2019-01-29 Yuanan Diao , Claus Ernst , Gabor Hetyei , Pengyu Liu

The braid indices of most links remain unknown as there is no known universal method that can be used to determine the braid index of an arbitrary knot. This is also the case for alternating knots. In this paper, we show that if $K$ is an…

几何拓扑 · 数学 2024-08-28 Yuanan Diao , Hugh Morton

It is known that the writhe calculated from any reduced alternating link diagram of the same (alternating) link has the same value. That is, it is a link invariant if we restrict ourselves to reduced alternating link diagrams. This is due…

几何拓扑 · 数学 2020-09-29 Yuanan Diao , Van Pham

It is well known that any link can be represented by the closure of a braid. The minimum number of strings needed in a braid whose closure represents a given link is called the braid index of the link and the well known…

几何拓扑 · 数学 2016-12-08 Pengyu Liu , Yuanan Diao , Gábor Hetyei

A long standing open conjecture states that if a link $\mathcal{K}$ is alternating, then its ropelength $L(\mathcal{K})$ is at least of the order $O(Cr(\mathcal{K}))$. A recent result shows that the maximum braid index of a link bounds the…

几何拓扑 · 数学 2021-08-25 Yuanan Diao

It has been conjectured that the algebraic crossing number of a link is uniquely determined in minimal braid representation. This conjecture is true for many classes of knots and links. The Morton-Franks-Williams inequality gives a lower…

几何拓扑 · 数学 2009-07-07 Keiko Kawamuro

For classical links Ohyama proved an inequality involving the minimal crossing number and the braid index, then motivated from this Takeda showed an analogous inequality for virtual links. In this paper, we are interested in studying…

几何拓扑 · 数学 2025-11-05 Gustavo Cardoso , Oscar Ocampo

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…

一般拓扑 · 数学 2019-08-27 Yuanan Diao , Claus Ernst , Gabor Hetyei

The determination of the braid index of an oriented link is generally a hard problem. In the case of alternating links, some significant progresses have been made in recent years which made explicit and precise braid index computations…

几何拓扑 · 数学 2024-03-22 Yuanan Diao , Claus Ernst , Gabor Hetyei

We give a geometric proof of the following result of Juhasz. \emph{Let $a_g$ be the leading coefficient of the Alexander polynomial of an alternating knot $K$. If $|a_g|<4$ then $K$ has a unique minimal genus Seifert surface.} In doing so,…

几何拓扑 · 数学 2018-07-17 Jessica E. Banks

The ribbonlength of a link is a geometric invariant defined as the infimum of the ratio of the length to the width of a folded ribbon realization of the link. In this paper, we prove that if an alternating link admits an alternating diagram…

几何拓扑 · 数学 2026-01-16 Hyungkee Yoo

Two Seifert surfaces of links in $S^3$ are said to be twist equivalent if one can be obtained from the other, up to isotopy, by repeatedly performing operations consisting of cutting along an embedded arc, applying a full twist near one…

几何拓扑 · 数学 2016-04-08 Carson Rogers

We define braid presentation of edge-oriented spatial graphs as a natural generalization of braid presentation of oriented links. We show that every spatial graph has a braid presentation. For an oriented link it is known that the braid…

几何拓扑 · 数学 2009-01-13 Ken Kanno , Kouki Taniyama

This paper is the second part of our comprehensive study on the braid index problem of pretzel links. Our ultimate goal is to completely determine the braid indices of all pretzel links, alternating or non alternating. In our approach, we…

几何拓扑 · 数学 2024-07-02 Yuanan Diao , Claus Ernst , Gabor Hetyei

The Tait conjecture states that alternating reduced diagrams of links in S^3 have the minimal number of crossings. It has been proved in 1987 by M. Thistlethwaite, L. Kauffman and K. Murasugi studying the Jones polynomial. The author proved…

几何拓扑 · 数学 2016-02-10 Alessio Carrega

We prove a Kauffman-Murasugi-Thistlethwaite theorem for alternating links in thickened surfaces. It states that any reduced alternating diagram of a link in a thickened surface has minimal crossing number, and any two reduced alternating…

几何拓扑 · 数学 2022-09-22 Hans U. Boden , Homayun Karimi

Let $L$ be an oriented link with an alternating diagram $D$. It is known that $L$ is a fibered link if and only if the surface $R$ obtained by applying Seifert's algorithm to $D$ is a Hopf plumbing. Here, we call $R$ a Hopf plumbing if $R$…

几何拓扑 · 数学 2007-05-23 Hiroshi Goda , Mikami Hirasawa , Ryosuke Yamamoto

A link is almost alternating if it is non-alternating and has a diagram that can be transformed into an alternating diagram via one crossing change. We give formulas for the first two and last two potential coefficients of the Jones…

几何拓扑 · 数学 2017-12-18 Adam M. Lowrance , Dean Spyropoulos

Given a knot diagram $D$, we construct a semi-threading circle for it which can be an axis of $D$ as a closed braid depending on knot diagrams. In particular, we consider semi-threading circles for minimal diagrams of a knot with respect to…

一般拓扑 · 数学 2013-02-18 Jae-Wook Chung , Seulgi Jeong , Dongseok Kim

Let $L$ be a non-split prime alternating link with $n>0$ crossings. We show that for each fixed $g$, the number of genus-$g$ Seifert surfaces for $L$ is bounded by an explicitly given polynomial in $n$. The result also holds for all…

几何拓扑 · 数学 2024-10-15 Joel Hass , Abigail Thompson , Anastasiia Tsvietkova
‹ 上一页 1 2 3 10 下一页 ›