English
Related papers

Related papers: Knot Tightening By Constrained Gradient Descent

200 papers

Given a set of $n$ points on a plane, in the Minimum Weight Triangulation problem, we wish to find a triangulation that minimizes the sum of Euclidean length of its edges. This incredibly challenging problem has been studied for more than…

Computational Geometry · Computer Science 2017-06-13 Sharath Raghvendra , Mariëtte C. Wessels

We present a computer simulation study of the compact self-avoiding loops as regards their length and topological state. We use a Hamiltonian closed path on the cubic-shaped segment of a 3D cubic lattice as a model of a compact polymer. The…

Soft Condensed Matter · Physics 2007-05-23 R. C. Lua , N. T. Moore , A. Yu. Grosberg

Many recent problems in signal processing and machine learning such as compressed sensing, image restoration, matrix/tensor recovery, and non-negative matrix factorization can be cast as constrained optimization. Projected gradient descent…

Optimization and Control · Mathematics 2022-09-07 Trung Vu , Raviv Raich

We develop a new technique for constructing sparse graphs that allow us to prove near-linear lower bounds on the round complexity of computing distances in the CONGEST model. Specifically, we show an $\widetilde{\Omega}(n)$ lower bound for…

Distributed, Parallel, and Cluster Computing · Computer Science 2016-05-18 Amir Abboud , Keren Censor-Hillel , Seri Khoury

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.…

Geometric Topology · Mathematics 2017-05-31 Andrey Boris Khesin

We study knots in $\mathbb{S}^3$ obtained by the intersection of a minimal surface in $\mathbb{R}^4$ with a small 3-sphere centered at a branch point. We construct examples of new minimal knots. In particular we show the existence of…

Differential Geometry · Mathematics 2007-05-23 Marc Soret , Marina Ville

One measure of geometrical complexity of a spatial curve is the number of crossings in a planar projection of the curve. For $N$-noded ring polymers with a fixed knot type, we evaluate numerically the average of the crossing number over…

Soft Condensed Matter · Physics 2016-08-31 Miyuki K. Shimamura , Tetsuo Deguchi

We probe the character of knotting in open, confined polymers, assigning knot types to open curves by identifying their projections as virtual knots. In this sense, virtual knots are transitional, lying in between classical knot types,…

Soft Condensed Matter · Physics 2020-01-29 Keith Alexander , Alexander J Taylor , Mark R Dennis

The mechanical properties of polymer knots under stretching in a bad or good solvent are investigated by applying a given force $F$ to a point of the knot while keeping another point fixed. The Monte Carlo sampling of the polymer…

Soft Condensed Matter · Physics 2015-12-15 Yani Zhao , Franco Ferrari

We present a methodology to simulate the mechanics of knots in elastic rods using geometrically nonlinear, full three-dimensional (3D) finite element analysis. We focus on the mechanical behavior of knots in tight configurations, for which…

Soft Condensed Matter · Physics 2021-02-03 Changyeob Baek , Paul Johanns , Tomohiko G. Sano , Paul Grandgeorge , Pedro M. Reis

We develop a theoretical description of the topological disentanglement occurring when torus knots reach the ends of a semi-flexible polymer under tension. These include decays into simpler knots and total unknotting. The minimal number of…

Statistical Mechanics · Physics 2020-11-04 Michele Caraglio , Boris Marcone , Fulvio Baldovin , Enzo Orlandini , Attilio L. Stella

The thickness, NIR(K) of a knot or link K is defined to be the radius of the largest solid tube one can put around the curve without any self intersections, which is also known as the normal injectivity radius of K. For C^{1,1} curves K,…

Geometric Topology · Mathematics 2007-06-08 Oguz C. Durumeric

The distortion of a curve measures the maximum arc/chord length ratio. Gromov showed any closed curve has distortion at least pi/2 and asked about the distortion of knots. Here, we prove that any nontrivial tame knot has distortion at least…

Geometric Topology · Mathematics 2007-12-29 Elizabeth Denne , John M Sullivan

A long standing open conjecture states that if a link $\mathcal{K}$ is alternating, then its ropelength $L(\mathcal{K})$ is at least of the order $O(Cr(\mathcal{K}))$. A recent result shows that the maximum braid index of a link bounds the…

Geometric Topology · Mathematics 2021-08-25 Yuanan Diao

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…

Geometric Topology · Mathematics 2023-01-09 Thomas D. Eddy , Clayton Shonkwiler

The theory of tunnel number 1 knots detailed in our previous paper, The tree of knot tunnels, provides a non-negative integer invariant called the depth of the tunnel. We give various results related to the depth invariant. Noting that it…

Geometric Topology · Mathematics 2007-08-28 Sangbum Cho , Darryl McCullough

The (isothermic) compressibility of lattice knots can be examined as a model of the effects of topology and geometry on the compressibility of ring polymers. In this paper, the compressibility of minimal length lattice knots in the simple…

Soft Condensed Matter · Physics 2015-06-04 Esaias J Janse van Rensburg , Andrew Rechnitzer

Approximately 1% of the known protein structures display knotted configurations in their native fold but their function is not understood. It has been speculated that the entanglement may inhibit mechanical protein unfolding or transport,…

Biological Physics · Physics 2009-11-13 Joachim Dzubiella

We consider the problem of adding a fixed number of new edges to an undirected graph in order to minimize the diameter of the augmented graph, and under the constraint that the number of edges added for each vertex is bounded by an integer.…

Data Structures and Algorithms · Computer Science 2023-02-14 Florian Adriaens , Aristides Gionis

We produce embeddings of knots in thin position that admit compressible thin levels. We also find the bridge number of tangle sums where each tangle is high distance.

Geometric Topology · Mathematics 2016-01-20 Ryan Blair , Alexander Zupan