中文
相关论文

相关论文: Region crossing change is an unknotting operation

200 篇论文

We explore free knot diagrams, which are projections of knots into the plane which don't record over/under data at crossings. We consider the combinatorial question of which free knot diagrams give which knots and with what probability.…

几何拓扑 · 数学 2020-11-25 Andrew Ducharme , Emily Peters

In this paper we introduce a representation of knots and links called a cube diagram. We show that a property of a cube diagram is a link invariant if and only if the property is invariant under two types of cube diagram operations. A knot…

几何拓扑 · 数学 2012-05-24 Scott Baldridge , Adam Lowrance

Let $D$ be a diagram of an alternating knot with unknotting number one. The branched double cover of $S^3$ branched over $D$ is an L-space obtained by half integral surgery on a knot $K_D$. We denote the set of all such knots $K_D$ by…

几何拓扑 · 数学 2021-11-01 Andrew Donald , Duncan McCoy , Faramarz Vafaee

Symmetries of knots have been studied extensively, and strongly invertible knots are one of them. Lamm defined the equivariant crossing number $c_t(K)$, the minimum crossing number among all symmetric diagrams for a strongly invertible knot…

几何拓扑 · 数学 2023-04-04 Jundai Nanasawa

Traditionally, knot theorists have considered projections of knots where there are two strands meeting at every crossing. A triple crossing is a crossing where three strands meet at a single point, such that each strand bisects the…

几何拓扑 · 数学 2018-05-14 Daishiro Nishida

Permutation decoding is a process that utilizes the permutation automorphism group of a linear code to correct errors in received words. Given a received word, a set of automorphisms, called a PD set, moves errors out of the information…

信息论 · 计算机科学 2026-02-25 Monica Lichtenwalner , Hiram H. López , Gretchen L. Matthews , Padmapani Seneviratne

A graph is periodic if it can be obtained by joining identical pieces in a cyclic fashion. It is shown that the limit crossing number of a periodic graph is computable. This answers a question of Benny Pinontoan and Bruce Richter (2004).

组合数学 · 数学 2014-05-21 Zdenek Dvorak , Bojan Mohar

We consider combinatorial maps with fixed combinatorial knot numbered with augmenting numeration called normalized knot. We show that knot's normalization doesn't affect combinatorial map what concerns its generality. Knot's normalization…

组合数学 · 数学 2010-10-14 Dainis Zeps

An overview of microlocality in braided ribbon networks is presented. Following this, a series of definitions are presented to explore the concept of microlocality and the topology of ribbon networks. Isolated substructure of ribbon…

高能物理 - 理论 · 物理学 2008-11-26 Jonathan Hackett

We consider the problem of deciding whether a polygonal knot in 3-dimensional Euclidean space is unknotted, capable of being continuously deformed without self-intersection so that it lies in a plane. We show that this problem, {\sc…

几何拓扑 · 数学 2007-05-23 Joel Hass , Jeffrey C. Lagarias , Nicholas Pippenger

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

Two natural generalizations of knot theory are the study of spatial graphs and virtual knots. Our goal is to unify these two approaches into the study of virtual spatial graphs. This paper is a survey, and does not contain any new results.…

几何拓扑 · 数学 2009-01-10 Thomas Fleming , Blake Mellor

We introduce a new numerical knot invariant, termed the \textit{segment number}, which is derived from partitioned knot diagrams subject to specific over/under-crossing constraints. We prove that a knot is non-trivial if and only if its…

几何拓扑 · 数学 2026-02-19 Makoto Ozawa

Minimum braids are a complete invariant of knots and links. This paper defines minimum braids, describes how they can be generated, presents tables for knots up to ten crossings and oriented links up to nine crossings, and uses minimum…

几何拓扑 · 数学 2007-05-23 Thomas A. Gittings

Interconnected networks are mathematical representation of systems where two or more simple networks are coupled to each other. Depending on the coupling weight between the two components, the interconnected network can function in two…

物理与社会 · 物理学 2015-10-28 Faryad Darabi Sahneh , Caterina Scoglio , Piet Van Mieghem

A multi-crossing (or n-crossing) is a singular point in a projection at which n strands cross so that each strand bisects the crossing. We generalize the classic result of Kauffman, Murasugi, and Thistlethwaite, which gives the upper bound…

A virtual knot, which is one of generalizations of knots in $\mathbb{R}^{3}$ (or $S^{3}$), is, roughly speaking, an embedded circle in thickened surface $S_{g} \times I$. In this talk we will discuss about knots in 3 dimensional $S_{g}…

几何拓扑 · 数学 2022-01-03 Seongjeong Kim

Classical knots in $\mathbb{R}^3$ can be represented by diagrams in the plane. These diagrams are formed by curves with a finite number of transverse crossings, where each crossing is decorated to indicate which strand of the knot passes…

We explain how to define the Robinson-Schensted-Knuth (RSK) correspondence in terms of local transformations called "toggles." (This note, which is not intended for publication and which is based on presentations of Alex Postnikov, was…

组合数学 · 数学 2025-10-28 Sam Hopkins

Noting that cycle diagrams of permutations visually resemble grid diagrams used to depict knots and links in topology, we consider the knot (or link) obtained from the cycle diagram of a permutation. We show that the permutations which…

组合数学 · 数学 2020-07-10 Christopher R. Cornwell , Nathan McNew
‹ 上一页 1 8 9 10 下一页 ›