中文
相关论文

相关论文: Crossing Number Bound in Knot Mosaics

200 篇论文

The slicing number of a knot, $u_s(K)$, is the minimum number of crossing changes required to convert $K$ to a slice knot. This invariant is bounded above by the unknotting number and below by the slice genus $g_s(K)$. We show that for many…

几何拓扑 · 数学 2008-02-18 Brendan Owens

We give an infinite family of knots such that for any given $r \geq 3$, the family contains a knot which can be embedded on a hexagonal $r$-mosaic, but cannot fit on a hexagonal $r$-mosaic in an embedding that achieves its crossing number.…

几何拓扑 · 数学 2026-04-20 Hugh Howards , Jiong Li , Xiaotian Liu , Anna Paulec

The {\it crossing number} of a graph $G$ is the minimum number of pairwise intersections of edges in a drawing of $G$. In this paper, we give the exact values of crossing numbers for some variations of hypercube with order at most four,…

组合数学 · 数学 2013-10-08 Guoqing Wang , Haoli Wang , Yuansheng Yang

Frequently, knots are enumerated by their crossing number. However, the number of knots with crossing number $c$ grows exponentially with $c$, and to date computer-assisted proofs can only classify diagrams up to around twenty crossings.…

几何拓扑 · 数学 2018-12-03 Yoav Moriah , Jessica S. Purcell

The crossing number ${\mbox {cr}}(G)$ of a graph $G=(V,E)$ is the smallest number of edge crossings over all drawings of $G$ in the plane. For any $k\ge 1$, the $k$-planar crossing number of $G$, ${\mbox {cr}}_k(G)$, is defined as the…

The ribbon number $r(K)$ of a ribbon knot $K \subset S^3$ is the minimal number of ribbon intersections contained in any ribbon disk bounded by $K$. We find new lower bounds for $r(K)$ using $\det(K)$ and $\Delta_K(t)$, and we prove that…

几何拓扑 · 数学 2024-08-22 Stefan Friedl , Filip Misev , Alexander Zupan

A knotted ribbon is one of physical aspect of a knot. A folded ribbon knot is a depiction of a knot obtained by folding a long and thin rectangular strip to become flat. The ribbonlength of a knot type can be defined as the minimum length…

几何拓扑 · 数学 2026-02-25 Hyoungjun Kim , Sungjong No , Hyungkee Yoo

The {\it crossing number} of a graph $G$ is the minimum number of pairwise intersections of edges in a drawing of $G$. In this paper, we study the crossing numbers of $K_{m}\times P_n$ and $K_{m}\times C_n$.

离散数学 · 计算机科学 2012-11-21 Yuansheng Yang , Baigong Zheng , Xirong Xu , Xiaohui Lin

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 stick number of a knot is the minimum number of segments needed to build a polygonal version of the knot. Despite its elementary definition and relevance to physical knots, the stick number is poorly understood: for most knots we only…

几何拓扑 · 数学 2023-01-09 Thomas D. Eddy , Clayton Shonkwiler

A quadruple crossing is a crossing in a projection of a knot or link that has four strands of the knot passing straight through it. A quadruple crossing projection is a projection such that all of the crossings are quadruple crossings. In a…

几何拓扑 · 数学 2019-02-20 Colin Adams

In this paper we compute the sharp lower bounds for the crossing number of $n$-string $k$-loop essential tangles. For essential tangles with only string components, we characterise the ones with the minimum crossing number for a given…

几何拓扑 · 数学 2017-08-30 João Miguel Nogueira , António Salgueiro

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

In this paper, we give a precise and workable definition of a quantum knot system, the states of which are called quantum knots. This definition can be viewed as a blueprint for the construction of an actual physical quantum system.…

量子物理 · 物理学 2008-05-06 Samuel J. Lomonaco , Louis H. Kauffman

For any given number of crossings $c$, there exists a formula to determine the number of 2-bridge knots of $c$ crossings, and indeed it is a simple matter to actually construct presentations of these knots. However, the determination of…

几何拓扑 · 数学 2007-05-23 David De Wit

It is known that the arc index of alternating knots is the minimal crossing number plus two and the arc index of prime nonalternating knots is less than or equal to the minimal crossing number. We study some cases when the arc index is…

几何拓扑 · 数学 2011-06-15 Gyo Taek Jin , Hwa Jeong Lee

Every knot can be embedded in the union of finitely many half planes with a common boundary line in such a way that the portion of the knot in each half plane is a properly embedded arc. The minimal number of such half planes is called the…

几何拓扑 · 数学 2010-10-15 Gyo Taek Jin , Wang Keun Park

We show that a knot whose minimum crossing number $c(K)$ is even and greater than $30$ is not fertile; there exists a knot $K'$ with crossing number less than $c$ such that $K'$ is not obtained from a minimum crossing number diagram of $K$…

几何拓扑 · 数学 2021-11-30 Tetsuya Ito

The aim of the present paper is to prove that the minimal number of virtual crossings for some families of virtual knots grows quadratically with respect to the minimal number of classical crossings. All previously known estimates for…

几何拓扑 · 数学 2011-07-26 Vassily Olegovich Manturov

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