Aldo-Hilario Cruz-Cota, Teresita Ramirez-Rosas
Let $K$ be a polygonal knot in general position with vertex set $V$. A \emph{generic quadrisecant} of $K$ is a line that is disjoint from the set $V$ and intersects $K$ in exactly four distinct points. We give an upper bound for the number of generic quadrisecants of a polygonal knot $K$ in general position. This upper bound is in terms of the number of edges of $K$.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
A quadrisecant of a knot is a straight line intersecting the knot at four points. If a knot has finitely many quadrisecants, one can replace each subarc between two adjacent secant points by the line segment between them to get the quadrisecant approximation of the original knot. It was conjectured that the quadrisecant approximation is always a knot with the same knot type as the original knot. We show that every knot type contains two knots, the quadrisecant approximation of one knot has self intersections while the quadrisecant approximation of the other knot is a knot with different knot t…
It is known that every nontrivial knot has at least two quadrisecants. Given a knot, we mark each intersection point of each of its quadrisecants. Replacing each subarc between two nearby marked points with a straight line segment joining them, we obtain a polygonal closed curve which we will call the quadrisecant approximation of the given knot. We show that for any hexagonal trefoil knot, there are only three quadrisecants, and the resulting quadrisecant approximation has the same knot type.
A quadrisecant line is one which intersects a curve in at least four points, while an essential secant captures something about the knottedness of a knot. This survey article gives a brief history of these ideas, and shows how they may be applied to questions about the geometry of a knot via the total curvature, ropelength and distortion of a knot.
We show that every non-trivial tame knot or link in R^3 has a quadrisecant, i.e. four collinear points. The quadrisecant must be topologically non-trivial in a precise sense. As an application, we show that a nonsingular, algebraic surface in R^3 which is a knotted torus must have degree at least eight.
Fix a straight line L in Euclidean 3-space and consider the fibration of the complement of L by half-planes. A generic knot K in the complement of L has neither fiber quadrisecants nor fiber extreme secants such that K touches the corresponding half-plane at 2 points. Both types of secants occur in generic isotopies of knots. We give lower bounds for the number of these fiber secants in all isotopies connecting given isotopic knots. The bounds are expressed in terms of invariants calculable in linear time with respect to the number of crossings.
It is known that for every knotted curve in space, there is a line intersecting it in four places, a quadrisecant. Comparing the order of the four points along the line and knot we can distinguish three types of quadrisecants; the alternating ones have the most relevance for the geometry of a knot. In this paper we prove that every (nontrivial tame) knot has an alternating quadrisecant. This result had applications to the total curvature, second hull and ropelength of knots.
Using the existence of a special quadrisecant line, we show the ropelength of any nontrivial knot is at least 15.66. This improves the previously known lower bound of 12. Numerical experiments have found a trefoil with ropelength less than 16.372, so our new bounds are quite sharp.
For a polygonal knot K, it is shown that a tube of radius R(K), the polygonal thickness radius, is an embedded torus. Given a thick configuration K, perturbations of size r<R(K) define satellite structures, or local knotting. We explore knotting within these tubes both theoretically and numerically. We provide bounds on perturbation radii for which we can see small trefoil and figure-eight summands and use Monte Carlo simulations to approximate the relative probabilities of these structures as a function of the number of edges.
We establish a fundamental connection between smooth and polygonal knot energies, showing that the Minimum Distance Energy for polygons inscribed in a smooth knot converges to the Moebius Energy of the smooth knot as the polygons converge to the smooth knot. However, the polygons must converge in a ``nice'' way, and the energies must be correctly regularized. We determine an explicit error bound between the energies in terms of the number of the edges of the polygon and the Ropelength of the smooth curve.
The space of n-sided polygons embedded in three-space consists of a smooth manifold in which points correspond to piecewise linear or ``geometric'' knots, while paths correspond to isotopies which preserve the geometric structure of these knots. The topology of these spaces for the case n = 6 and n = 7 is described. In both of these cases, each knot space consists of five components, but contains only three (when n = 6) or four (when n = 7) topological knot types. Therefore ``geometric knot equivalence'' is strictly stronger than topological equivalence. This point is demonstrated by the hexag…
Previous work used polygonal realizations of knots to reduce the problem of computing the superbridge number of a realization to a linear programming problem, leading to new sharp upper bounds on the superbridge index of a number of knots. The present work extends this technique to polygonal realizations with an odd number of edges and determines the exact superbridge index of many new knots, including the majority of the 9-crossing knots for which it was previously unknown and, for the first time, several 12-crossing knots. Interestingly, at least half of these superbridge-minimizing polygona…
We study the variation of the Tait number of a closed space curve according to its different projections. The results are used to compute the writhe of a knot, leading to a closed formula in case of polygonal curves.
Smooth Knots with Odd Quadratic Term of the Conway Polynomial Have Inscribed Trefoils
该研究通过定向类双覆叠扰动与平面构型分析，证明Conway多项式具奇二次项的光滑纽结存在内接三叶结，并补充解析情形下同时存在左右手内接三叶结的结论。
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 unknotting problem} is in {\bf NP}. We also consider the problem, {\sc unknotting problem} of determining whether two or more such polygons can be split, or continuously deformed without self-intersection so that they occupy both sides of a plane without intersecting it. We show that it also is in NP. Finally, we show that the problem of determining the genus of a …
An upper bound of the superbridge index of the connected sum of two knots is given in terms of the braid index of the summands. Using this upper bound and minimal polygonal presentations, we give an upper bound in terms of the superbridge index and the bridge index of the summands when they are torus knots. In contrast to the fact that the difference between the sum of bridge indices of two knots and the bridge index of their connected sum is always one, the corresponding difference for the superbridge index can be arbitrarily large.
An equilateral stick number $s_{=}(K)$ of a knot $K$ is defined to be the minimal number of sticks required to construct a polygonal knot of $K$ which consists of equal length sticks. Rawdon and Scharein [12] found upper bounds for the equilateral stick numbers of all prime knots through 10 crossings by using algorithms in the software KnotPlot. In this paper, we find an upper bound on the equilateral stick number of a nontrivial knot K in terms of the minimal crossing number $c(K)$ which is $s_{=}(K) \le 2c(K) + 2$. Moreover if $K$ is a non-alternating prime knot, then $s_{=}(K) \le 2c(K) - 2…
New Upper Bounds for Stick Numbers
本研究利用带纽结类型保持移动的模拟退火方法寻找低杆数多边形纽结，改进了10交叉内素纽结的杆数上界，首次给出13交叉内所有纽结的杆数界表，并确定了19种未知杆数纽结的精确值。
The image of a polygonal knot K under a spherical inversion of R^3 (union infinity) is a simple closed curve made of arcs of circles, having the same knot type as the mirror image of K. Suppose we reconnect the vertices of the inverted polygon with straight lines, making a new polygon. This may be a different knot type. For example, a certain 7-segment figure-8 knot can be transformed to a figure-8 knot, right and left handed trefoils, or an unknot, by selecting different inverting spheres. Which knot types can be obtained from a given original polygon K under this process? We show that for la…
Knots and links have been considered to be useful models for structural analysis of molecular chains such as DNA and proteins. One quantity that we are interested on molecular links is the minimum number of monomers necessary to realize them. In this paper we consider every link in the cubic lattice. Lattice stick number $s_L(L)$ of a link $L$ is defined to be the minimal number of sticks required to construct a polygonal representation of the link in the cubic lattice. Huh and Oh found all knots whose lattice stick numbers are at most 14. They proved that only the trefoil knot $3_1$ and the f…
There is a positive constant $c_1$ such that for any diagram $D$ representing the unknot, there is a sequence of at most $2^{c_1 n}$ Reidemeister moves that will convert it to a trivial knot diagram, $n$ is the number of crossings in $D$. A similar result holds for elementary moves on a polygonal knot $K$ embedded in the 1-skeleton of the interior of a compact, orientable, triangulated $PL$ 3-manifold $M$. There is a positive constant $c_2$ such that for each $t \geq 1$, if $M$ consists of $t$ tetrahedra, and $K$ is unknotted, then there is a sequence of at most $2^{c_2 t}$ elementary moves in…
Discriminant Varieties for Stick Knots and Links
该研究解决固定数量直棍可构造结型数量的增长阶问题，通过将多边形自相交转化为稀疏实代数腔问题，结合辫结构造得到阶乘级最优上界，建立了多个数学领域间的直接联系。
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 know bounds on the stick number. We adopt a Monte Carlo approach to finding better bounds, producing very large ensembles of random polygons in tight confinement to look for new examples of knots constructed from few segments. We generated a total of 220 billion random polygons, yielding either the exact stick number or an improved upper bound for more than 4…
Geometric densities and compression radii of knot types
研究嵌入三维欧几里得空间中的闭合曲线的尺度不变几何量，关注其在固定结型下的优化行为。定义D-密度、D-压缩半径及打包比，探讨其在优化后的分离特性。
Knot Tightening By Constrained Gradient Descent
该研究提出约束梯度下降法求解固定厚度下近似长度最小的打结多边形，推导了相关理论准则，得到379个覆盖指定交叉数范围的素纽结与链环的绳长结果及自接触图谱，提升了纽结绳长精度并首次发表链环绳长数据。
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。