中文
相关论文

相关论文: Special alternating links of minimal unlinking num…

200 篇论文

It is known that algebraically split links (links with vanishing pairwise linking number) can be transformed into the trivial link by a series of local moves on the link diagram called delta-moves; we define the delta-unlinking number to be…

几何拓扑 · 数学 2021-07-15 Anthony Bosman , Jeannelle Green , Gabriel Palacios , Moises Reyes , Noe Reyes

The splitting number of a link is the minimal number of crossing changes between different components required to convert it into a split link. We obtain a lower bound on the splitting number in terms of the (multivariable) signature and…

几何拓扑 · 数学 2016-10-27 David Cimasoni , Anthony Conway , Kleopatra Zacharova

Given a virtual link diagram $D$, we define its unknotting index $U(D)$ to be minimum among $(m, n)$ tuples, where $m$ stands for the number of crossings virtualized and $n$ stands for the number of classical crossing changes, to obtain a…

几何拓扑 · 数学 2020-11-09 Kirandeep Kaur , Madeti Prabhakar , Andrei Vesnin

We provide an algorithm to determine whether a link L admits a crossing change that turns it into a split link, under some fairly mild hypotheses on L. The algorithm also provides a complete list of all such crossing changes. It can…

几何拓扑 · 数学 2021-03-02 Marc Lackenby

The splitting number of a link is the minimal number of crossing changes between different components required, on any diagram, to convert it to a split link. We introduce new techniques to compute the splitting number, involving covering…

几何拓扑 · 数学 2013-08-27 Jae Choon Cha , Stefan Friedl , Mark Powell

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

Ito-Takimura recently defined a splice-unknotting number $u^-(D)$ for knot diagrams. They proved that this number provides an upper bound for the crosscap number of any prime knot, asking whether equality holds in the alternating case. We…

几何拓扑 · 数学 2020-08-18 Thomas Kindred

Ascending numbers are determined for 64 knots with at most n=10 crossings. After proving the theorem about the signature of alternating knot families, we distinguished all families of knots obtained from generating alternating knots with at…

几何拓扑 · 数学 2011-07-13 Slavik Jablan

Computing unlinking number is usually very difficult and complex problem, therefore we define BJ-unlinking number and recall Bernhard-Jablan conjecture stating that the classical unknotting/unlinking number is equal to the BJ-unlinking…

一般拓扑 · 数学 2011-11-09 Slavik Jablan , Radmila Sazdanović

We use the rational Witt class of a knot in the 3-sphere as a tool for addressing questions about its unknotting number. We apply these tools to several low crossing knots (151 knots with 11 crossing and 100 knots with 12 crossings) and to…

几何拓扑 · 数学 2009-07-15 Stanislav Jabuka

Given a knot K we introduce a new invariant coming from the Blanchfield pairing and we show that it gives a lower bound on the unknotting number of K. This lower bound subsumes the lower bounds given by the Levine-Tristram signatures, by…

几何拓扑 · 数学 2015-05-27 Maciej Borodzik , Stefan Friedl

In this paper we investigate the unlinking numbers of 10-crossing links. We make use of various link invariants and explore their behaviour when crossings are changed. The methods we describe have been used previously to compute unlinking…

几何拓扑 · 数学 2018-03-16 Lavinia Bulai

We will strengthen the known upper and lower bounds on the delta-crossing number of knots in therms of the triple-crossing number. The latter bound turns out to be strong enough to obtain (unknown values of) triple-crossing numbers for a…

几何拓扑 · 数学 2023-03-06 Michal Jablonowski

The weak splitting number $wsp(L)$ of a link $L$ is the minimal number of crossing changes needed to turn $L$ into a split union of knots. We describe conditions under which certain $\mathbb{R}$-valued link invariants give lower bounds on…

几何拓扑 · 数学 2020-05-12 Alberto Cavallo , Carlo Collari , Anthony Conway

A well-known algorithm for unknotting knots involves traversing a knot diagram and changing each crossing that is first encountered from below. The minimal number of crossings changed in this way across all diagrams for a knot is called the…

几何拓扑 · 数学 2024-09-27 Lowell Davis , Jeffrey Meier

The doubly slice genus of a knot in the 3-sphere is the minimal genus among unknotted orientable surfaces in the 4-sphere for which the knot arises as a cross-section. We use the classical signature function of the knot to give a new lower…

几何拓扑 · 数学 2020-08-11 Patrick Orson , Mark Powell

The unknotting number of a knot is the minimum number of crossings one must change to turn that knot into the unknot. The algebraic unknotting number is the minimum number of crossing changes needed to transform a knot into an Alexander…

几何拓扑 · 数学 2016-06-22 Kenan Ince

This paper investigates the relationship between the signature and the crossing number of knots and links. We refine existing theorems and provide a comprehensive classification of links with specific properties, particularly those with…

几何拓扑 · 数学 2024-10-02 Kai Ishihara , Kei Okada , Koya Shimokawa

We prove that if an alternating knot has unknotting number one, then there exists an unknotting crossing in any alternating diagram. This is done by showing that the obstruction to unknotting number one developed by Greene in his work on…

几何拓扑 · 数学 2017-04-11 Duncan McCoy

Let $D$ be a reduced alternating diagram of a non-split link $L$ and $\tilde{L}$ be the link whose diagram is obtained from $D$ by a crossing change. If $\tilde{L}$ is alternating, then $c(\tilde{L})\leq c(L)-2$. In this paper we explore…

几何拓扑 · 数学 2014-07-02 Xian'an Jin , Fuji Zhang , Jun Ge
‹ 上一页 1 2 3 10 下一页 ›