中文
相关论文

相关论文: The almost alternating diagrams of the trivial kno…

200 篇论文

A graph G is called "minimalizable" if a diagram with minimal crossing number can be obtained from an arbitrary diagram of G by crossing changes. If, furthermore, the minimal diagram is unique up to crossing changes then G is called…

几何拓扑 · 数学 2007-05-23 J. Sawollek

For any knot with genus one and unknotting number one, other than the figure-eight knot, we prove that there is exactly one way to unknot it by means of a crossing change. In the case of the figure-eight knot, we prove that there are…

几何拓扑 · 数学 2009-05-15 Alexander Coward , Marc Lackenby

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…

几何拓扑 · 数学 2015-06-03 Zhiyun Cheng

The transient number of a knot K, denoted tr(K), is the minimal number of simple arcs that have to be attached to K, in order that K can be homotoped to a trivial knot in a regular neighborhood of the union of K and the arcs. We give a…

几何拓扑 · 数学 2024-11-27 Mario Eudave-Muñoz , Joan Carlos Segura Aguilar

This paper is expository and is accessible to students. We define simple invariants of knots or links (linking number, Arf-Casson invariants and Alexander-Conway polynomials) motivated by interesting results whose statements are accessible…

几何拓扑 · 数学 2021-12-15 A. Skopenkov

In previous papers, the author realized the following principle for many knot theories: if a knot diagram is complicated enough then it reproduces itself, i.e., is a subdiagram of any other diagram equivalent to it. This principle is…

几何拓扑 · 数学 2015-02-03 Vassily Olegovich Manturov

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

Consider a robot that remembers only the starting position and walks along a knot once on a knot diagram, switching every undercrossing it meets until it returns to the starting position. We observe that the robot produces an ascending…

For any link in the 3-sphere, there is a natural lower bound for the unlinking number in terms of the classical signature. We prove that if this lower bound is sharp for a special alternating link $L$, then the unlinking number of $L$ is…

几何拓扑 · 数学 2026-03-25 Duncan McCoy , JungHwan Park

We are giving tables of quasi-alternating knots with $8\le n \le 12$ crossings. As the obstructions for a knot to be quasialternating we used homology thickness with regards to Khovanov homology, odd homology, and Heegaard-Floer homology…

几何拓扑 · 数学 2014-04-23 Slavik Jablan

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

The notion of a braided chord diagram is introduced and studied. An equivalence relation is given which identifies all braidings of a fixed chord diagram. It is shown that finite-type invariants are stratified by braid index for knots which…

几何拓扑 · 数学 2007-05-23 Joan S. Birman , Rolland Trapp

We introduce an unknotting-type number of knot projections that gives an upper bound of the crosscap number of knots. We determine the set of knot projections with the unknotting-type number at most two, and this result implies classical…

几何拓扑 · 数学 2020-08-26 Noboru Ito , Yusuke Takimura

An alternating distance is a link invariant that measures how far away a link is from alternating. We study several alternating distances and demonstrate that there exist families of links for which the difference between certain…

几何拓扑 · 数学 2015-03-03 Adam M. Lowrance

This paper, to be regularly updated, lists those prime knots with the fewest possible number of crossings for which values of basic knot invariants, such as the unknotting number or the smooth 4-genus, are unknown. This list is being…

几何拓扑 · 数学 2018-08-16 Jae Choon Cha , Charles Livingston

Knotoids are open ended knot diagrams regarded up to Reidemeister moves and isotopies. The notion is introduced by V.~Turaev in 2012. Two most important numeric characteristics of a knotoid are the crossing number and the height. The latter…

几何拓扑 · 数学 2020-09-08 Philipp Korablev , Vladimir Tarkaev

We call an oriented odd cycle alternating if it has exactly one vertex whose in-degree and out-degree are both positive. In this paper, we investigate whether certain graphs admit an orientation that avoids alternating odd cycles as…

组合数学 · 数学 2025-08-27 Nóra Almási , Gábor Simonyi

There is an infinitely generated free subgroup of the smooth knot concordance group with the property that no nontrivial element in this subgroup can be represented by an alternating knot. This subgroup has the further property that every…

几何拓扑 · 数学 2017-07-21 Stefan Friedl , Charles Livingston , Raphael Zentner

The altenating knots, links and twists projected on the S_2 sphere are identified with the phase Space of a Hamiltonian dynamic system of one degree of freedom. The saddles of the system correspond to the crossing points, the edges, to the…

几何拓扑 · 数学 2007-05-23 Eduardo Pina