中文
相关论文

相关论文: Strict Inequalities for the $n$-crossing Number

200 篇论文

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 graph is $1$-planar, if it can be drawn in the plane such that there is at most one crossing on every edge. It is known, that $1$-planar graphs have at most $4n-8$ edges. We prove the following odd-even generalization. If a graph can be…

组合数学 · 数学 2022-08-26 János Karl , Géza Tóth

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

Let $D_+(K,t)$ denote the positive $t$-twisted double of $K$. For a fixed integer-valued additive concordance invariant $\nu$ that bounds the smooth four genus of a knot and determines the smooth four genus of positive torus knots,…

几何拓扑 · 数学 2016-03-16 JungHwan Park

We explore under what conditions one can obtain a nontrivial knot, given a collection of $n$ vectors. First, we show how to get a crossing from any 3 vectors equal in magnitude, by arbitrarily picking 2 vectors and identifying the…

几何拓扑 · 数学 2016-12-21 Joseph Borgatti

The crossing number of a graph is the minimum number of edge crossings that a graph can have when drawn in the plane. Determining this number, known as the Crossing Number problem, is a celebrated problem in combinatorial optimization. It…

计算几何 · 计算机科学 2026-03-30 Petr Hliněný , Liana Khazaliya

We give examples showing that Kidwell's inequality for the maximal degree of the Brandt-Lickorish-Millett-Ho polynomial is in general not sharp.

几何拓扑 · 数学 2008-08-30 A. Stoimenow

In 1928, Alexander defined a sequence of knot polynomials, D_i(K). The first, D_1(K), is the classical Alexander polynomial. These are easily defined in terms of the homology of the infinite cyclic cover of the knot. In theory they can be…

几何拓扑 · 数学 2025-11-11 Charles Livingston

We give a criterion for distinguishing a prime knot $K$ in $S^3$ from every other knot in $S^3$ using the finite quotients of $\pi_1(S^3\setminus K)$. Using recent work of Baldwin-Sivek, we apply this criterion to the hyperbolic knots…

几何拓扑 · 数学 2022-11-15 Tamunonye Cheetham-West

We determine a simple condition on a particular state graph of an alternating knot or link diagram that characterizes when the unoriented genus and crosscap number coincide, extending work of Adams and Kindred. Building on this same work…

The crossing number of a graph $G$ is the minimum number of pairwise intersections of edges among all drawings of $G$. In this paper, we study the crossing number of $K_{n,n}-nK_2$, $K_n\times P_2$, $K_n\times P_3$ and $K_n\times C_4$.

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

Jablan and Radovi\'c originally defined two invariants called the Meander number and OGC number of knots for certain classes of knots. We generalize these definitions to all knots and name the straight number and contained straight number…

几何拓扑 · 数学 2018-04-16 Nicholas Owad

For an integer $n$, write $X_n(K)$ for the 4-manifold obtained by attaching a 2-handle to the 4-ball along the knot $K\subset S^3$ with framing $n$. It is known that if $n< \overline{\text{tb}}(K)$, then $X_n(K)$ admits the structure of a…

几何拓扑 · 数学 2017-10-24 Thomas E. Mark , Lisa Piccirillo , Faramarz Vafaee

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

We introduce new sufficient conditions for intrinsic knotting and linking. A graph on n vertices with at least 4n-9 edges is intrinsically linked. A graph on n vertices with at least 5n-14 edges is intrinsically knotted. We also classify…

几何拓扑 · 数学 2007-05-23 J. Campbell , T. W. Mattman , R. Ottman , J. Pyzer , M. Rodrigues , S. Williams

The algebraic unknotting number u_a(K) of a knot K was introduced by Hitoshi Murakami. It equals the minimal number of crossing changes needed to turn K into an Alexander polynomial one knot. In a previous paper the authors used the…

几何拓扑 · 数学 2013-08-29 Maciej Borodzik , Stefan Friedl

The knots $8_1$, $8_2$, $8_3$, $8_5$, $8_6$, $8_7$, $8_8$, $8_{10}$, $8_{11}$, $8_{12}$, $8_{13}$, $8_{14}$, $8_{15}$, $9_7$, $9_{16}$, $9_{20}$, $9_{26}$, $9_{28}$, $9_{32}$, and $9_{33}$ all have superbridge index equal to 4. This follows…

几何拓扑 · 数学 2021-08-06 Clayton Shonkwiler

The untwisting number of a knot K is the minimum number of null-homologous twists required to convert K to the unknot. Such a twist can be viewed as a generalization of a crossing change, since a classical crossing change can be effected by…

The number $|K|$ of non-isotopic framed knots that correspond to a given unframed knot $K\subset S^3$ is infinite. This follows from the existence of the self-linking number $\slk$ of a zerohomologous framed knot. We use the approach of…

几何拓扑 · 数学 2007-05-23 Vladimir Chernov

We present a complete classification of spherical knotoids with up to six crossings and conjecture that our classification up to seven crossings is complete. Our work extends the tradition of knot tabulation to the setting of knotoids…

几何拓扑 · 数学 2026-03-09 Boštjan Gabrovšek , Paolo Cavicchioli