中文
相关论文

相关论文: On the warping sum of knots

200 篇论文

For an oriented knot diagram D, the warping degree d(D) is the smallest number of crossing changes which are needed to obtain the monotone diagram from D in the usual way. We show that d(D) + d(-D) + 1 is less than or equal to the crossing…

几何拓扑 · 数学 2009-06-02 Ayaka Shimizu

The warping degree of an oriented knot diagram is the minimal number of crossing changes which are required to obtain a monotone knot diagram from the diagram. The minimal warping degree of a knot is the minimal value of the warping degree…

几何拓扑 · 数学 2020-05-01 Ayaka Shimizu

We introduce the warping polynomial of an oriented knot diagram. In this paper, we characterize the warping polynomial, and define the span of a knot to be the minimal span of the warping polynomial for all diagrams of the knot. We show…

几何拓扑 · 数学 2011-12-12 Ayaka Shimizu

The warping degree of an oriented knot diagram is the minimal number of crossings which we meet as an under-crossing first when we travel along the diagram from a fixed point. The warping degree of a knot projection is the minimal value of…

几何拓扑 · 数学 2021-01-25 Atsushi Ohya , Ayaka Shimizu

A weaving knot is an alternating knot whose minimal diagram is a closed braid of a lattice-like pattern. In this paper, the warping degree of a braid diagram is defined, and upper bounds of the unknotting number and the region unknotting…

几何拓扑 · 数学 2025-11-06 Ayaka Shimizu , Amrendra Gill , Sahil Joshi

We introduce the warping matrix which is a new description of oriented knots from a viewpoint of warping degree.

几何拓扑 · 数学 2015-08-17 Ayaka Shimizu

A minimal knot is the intersection of a topologically embedded branched minimal disk in $\mathbb{R}^4$ $\mathbb{C}^2 $ with a small sphere centered at the branch point. When the lowest order terms in each coordinate component of the…

微分几何 · 数学 2012-12-12 Marc Soret , Marina Ville

The slicing degree of a knot $K$ is defined as the smallest integer $k$ such that $K$ is $k$-slice in $\#^n \overline{\mathbb{CP}^2}$ for some $n$. In this paper, we establish bounds for the slicing degrees of knots using Rasmussen's…

几何拓扑 · 数学 2024-04-25 Qianhe Qin

For an oriented link diagram D, the warping degree d(D) is the smallest number of crossing changes which are needed to obtain a monotone diagram from D. We show that d(D)+d(-D)+sr(D) is less than or equal to the crossing number of D, where…

几何拓扑 · 数学 2009-12-27 Ayaka Shimizu

The simultaneous crossing number is a new knot invariant which is defined for strongly invertible knots having diagrams with two orthogonal transvergent axes of strong inversions. Because the composition of the two inversions gives a cyclic…

几何拓扑 · 数学 2025-04-16 Christoph Lamm , Michael Eisermann

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

Given a knot $K$ parametrized by $r: [0,2\pi] \to \mathbb{R}^3$, we can define the electric potential on its complement by $\Phi(x) = \int_0^{2\pi} \frac{|r'(t)|}{|x - r(t)|}dt$. Physicists and knot theorists want to understand the critical…

动力系统 · 数学 2021-04-02 Max Lipton

Let $u(K)$ and $g(K)$ denote the unknotting number and the genus of a knot $K$, respectively. For a 3-braid knot $K$, we show that $u(K)\le g(K)$ holds, and that if $u(K)=g(K)$ then $K$ is either a 2-braid knot, a connected sum of two…

几何拓扑 · 数学 2014-01-28 Eon-Kyung Lee , Sang-Jin Lee

A fixed knot $K$ acts via Murasugi sum on the space $\mathcal{S}$ of isotopy classes of knots. This operation endows $\mathcal{S}$ with a directed graph structure denoted by $M\kern-1pt SG(K)$. We show that any given family of knots in…

几何拓扑 · 数学 2021-12-02 Jared Able , Mikami Hirasawa

The connected sum of two flat virtual knots depends on the choice of diagrams and basepoints. We show that any minimal crossing diagram of a composite flat virtual knot is a connected sum diagram. We also show the crossing number of flat…

几何拓扑 · 数学 2024-07-26 Jie Chen

Let $c(K)$ denote the crossing number of a knot $K$ and let $K_1\# K_2$ denote the connected sum of two oriented knots $K_1$ and $K_2$. It is a very old unsolved question that whether $c(K_1\# K_2)=c(K_1)+c(K_2)$. In this paper we show that…

几何拓扑 · 数学 2024-07-16 Ruifeng Qiu , Chao Wang

The probability of a random polygon (or a ring polymer) having a knot type $K$ should depend on the complexity of the knot $K$. Through computer simulation using knot invariants, we show that the knotting probability decreases exponentially…

软凝聚态物质 · 物理学 2009-11-07 Miyuki K. Shimamura , Tetsuo Deguchi

We introduce two numerical invariants, the waist and the trunk of knots. The waist of a closed incompressible surface in the complement of a knot is defined as the minimal intersection number of all compressing disks for the surface in the…

几何拓扑 · 数学 2009-06-01 Makoto Ozawa

It is a very old conjecture that the crossing number of knots is additive under connected sum. In other words, if K#K' is the connected sum of knots K and K', then does the equality c(K#K') = c(K) + c(K') hold? We prove that c(K#K') is at…

几何拓扑 · 数学 2014-02-26 Marc Lackenby

Let $K$ be a tunnel number two knot. Then, by considering the $(g, b)$-decompositions, $K$ is one of (3, 0)-, (2, 1)-, (1, 2)- or (0, 3)-knots. In the present paper, we analyze the connected sum summands of composite tunnel number two knots…

几何拓扑 · 数学 2014-09-04 Kanji Morimoto
‹ 上一页 1 2 3 10 下一页 ›