中文
相关论文

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

200 篇论文

X.S. Lin and O. Dasbach proved that the sum of the absolute value of the second and penultimate coefficients of the Jones polynomial of an alternating knot is equal to the twist number of the knot. In this paper we give a new proof of their…

几何拓扑 · 数学 2007-05-23 Robert G. Todd

Let $b_{n,k}$ denote the number of hooks of length $k$ in all the $t$-regular partitions of $n$. Singh and Barman raised the question of finding the relation between $b_{t,2}(n)$ and $b_{t,1}(n)$. Kim showed that there exists $N$ such that…

组合数学 · 数学 2025-05-01 Hongshu Lin , Wenston J. T. Zang

The unknotting number of a positive braid with n strands and k intersections is known to be equal to (k-n+1)/2. We consider Lorenz knots (which are positive braids) and, using a different method, find their unknotting numbers in terms of…

几何拓扑 · 数学 2015-03-04 Lilya Lyubich

The list of knots with up to 10 crossings is commonly referred to as the Rolfsen Table. This paper presents a way to generate the Rolfsen table in a simple, clear, and reproducible manner. The methods we use are similar to those used by J.…

几何拓扑 · 数学 2017-05-31 Andrey Boris Khesin

It is well-known that the number of non-crossing perfect matchings of $2k$ points in convex position in the plane is $C_k$, the $k$th Catalan number. Garc\'ia, Noy, and Tejel proved in 2000 that for any set of $2k$ points in general…

计算几何 · 计算机科学 2015-02-19 Andrei Asinowski

Physical knot classification is a challenging fine-grained recognition task in which the intended discriminative cue is rope crossing structure; however, high closed-set accuracy may still arise from low-level appearance shortcuts rather…

计算机视觉与模式识别 · 计算机科学 2026-04-23 Shiheng Nie , Yunguang Yue

We show that the crossing number of a satellite knot is at least 10^{-13} times the crossing number of its companion knot.

几何拓扑 · 数学 2014-11-11 Marc Lackenby

We prove that for 2-bridge knots, the diameter, D, of the set of boundary slopes is twice the crossing number, c. This constitutes partial verification of a conjecture that, for all knots in S^3, D is at most 2c.

几何拓扑 · 数学 2007-05-23 Thomas W. Mattman , Gabriel Maybrun , Kristin Robinson

We will develop various methods, some are of geometric nature and some are of algebraic nature, to detect the various achiralities of knots and links in $S^3$. For example, we show that the twisted Whitehead double of a knot is achiral if…

几何拓扑 · 数学 2007-05-23 Boju Jiang , Xiao-Song Lin , Shicheng Wang , Ying-Qing Wu

We introduce the notion of slice depth of a 2-knot K, which is the minimal integer n such that K is n-slice. We give an upper bound for the slice depth of the n-twist spin of a classical knot which belongs to several specific classes,…

几何拓扑 · 数学 2025-09-24 Ayaka Ise

We derive new obstructions to periodicity of classical knots by employing the Heegaard Floer correction terms of the finite cyclic branched covers of the knots. Applying our results to two fold covers, we demonstrate through numerous…

几何拓扑 · 数学 2014-09-23 Stanislav Jabuka , Swatee Naik

Counterterms that are not reducible to $\zeta_{n}$ are generated by ${}_3F_2$ hypergeometric series arising from diagrams for which triangle and uniqueness relations furnish insufficient data. Irreducible double sums, corresponding to the…

高能物理 - 理论 · 物理学 2008-02-03 D. J. Broadhurst , J. A. Gracey , D. Kreimer

We prove that any $11$-colorable knot is presented by an $11$-colored diagram where exactly five colors of eleven are assigned to the arcs. The number five is the minimum for all non-trivially $11$-colored diagrams of the knot. We also…

几何拓扑 · 数学 2015-05-13 Takuji Nakamura , Yasutaka Nakanishi , Shin Satoh

In this paper we present three different results dealing with the number of $(\leq k)$-facets of a set of points: 1. We give structural properties of sets in the plane that achieve the optimal lower bound $3\binom{k+2}{2}$ of $(\leq…

组合数学 · 数学 2020-07-21 Oswin Aichholzer , Jesús García , David Orden , Pedro Ramos

We use recently introduced Rasmussen invariant to find knots that are topologically locally-flatly slice but not smoothly slice. We note that this invariant can be used to give a combinatorial proof of the slice-Bennequin inequality.…

几何拓扑 · 数学 2018-06-19 Alexander N. Shumakovitch

The crossing number cr(G) of a graph G is the minimum number of crossings in a nondegenerate planar drawing of G. The rectilinear crossing number cr'(G) of G is the minimum number of crossings in a rectilinear nondegenerate planar drawing…

We investigate an application of crossing parity for the bracket expansion of the Jones polynomial for virtual knots. In addition we consider an application of parity for the arrow polynomial as well as for the categorifications of both…

几何拓扑 · 数学 2011-10-25 Aaron Kaestner , Louis H. Kauffman

A powerful way to study groups is via their actions on suitable spaces. Classifying spaces for families of subgroups are a type of these spaces, obtained by imposing some strict conditions on the fixed-point sets. We show how in the…

代数拓扑 · 数学 2016-11-11 Federico William Pasini

We use idempotents in quandle rings in combination with the state sum invariants of knots to distinguish all of the 12965 prime oriented knots up to 13 crossings using only 21 connected quandles and three quandles made of idempotents in…

几何拓扑 · 数学 2024-07-01 Mohamed Elhamdadi , Dipali Swain

Introducing a way to modify knots using $n$-trivial rational tangles, we show that knots with given values of Vassiliev invariants of bounded degree can have arbitrary unknotting number (extending a recent result of Ohyama, Taniyama and…

几何拓扑 · 数学 2007-05-23 A. Stoimenow
‹ 上一页 1 8 9 10 下一页 ›