相关论文: Ropelength of tight polygonal knots

We consider the problem of approximating a two-dimensional shape contour (or curve segment) using discrete assembly systems, which allow to build geometric structures based on limited sets of node and edge types subject to edge length and…

We study the formation of knots on a macroscopic ball-chain, which is shaken on a horizontal plate at 12 times the acceleration of gravity. We find that above a certain critical length, the knotting probability is independent of chain…

We consider the force on the end of a polymer chain being pulled through a network at velocity $v$, using computer simulations. We develop algorithms for measuring the force on the end of the chain using lattice models of polymers. Our…

Knot theory provides a powerful tool for the understanding of topological matters in biology, chemistry, and physics. Here knot theory is introduced to describe topological phases in the quantum spin system. Exactly solvable models with…

A knot is a circle piecewise-linearly embedded into the 3-sphere. The topology of a knot is intimately related to that of its exterior, which is the complement of an open regular neighborhood of the knot. Knots are typically encoded by…

The trunk of a knot in $S^3$, defined by Makoto Ozawa, is a measure of geometric complexity similar to the bridge number or width of a knot. We prove that for any two knots $K_1$ and $K_2$, we have $tr(K_1 \# K_2) =…

Lightweight model design has become an important direction in the application of deep learning technology, pruning is an effective mean to achieve a large reduction in model parameters and FLOPs. The existing neural network pruning methods…

The (Strong) Slope Conjecture relates the degree of the colored Jones polynomial of a knot to certain essential surfaces in the knot complement. We verify the Slope Conjecture and the Strong Slope Conjecture for 3-string Montesinos knots…

We investigate the effect of knot type on the properties of a ring polymer confined to a slit. For relatively wide slits, the more complex the knot, the more the force exerted by the polymer on the walls is decreased compared to an…

We consider the expected value for the total curvature of a random closed polygon. Numerical experiments have suggested that as the number of edges becomes large, the difference between the expected total curvature of a random closed…

This paper employs various computational techniques to determine the bridge numbers of both classical and virtual knots. For classical knots, there is no ambiguity of what the bridge number means. For virtual knots, there are multiple…

Let K be a tame knot with irreducible exterior M(K) in a closed, connected, orientable 3--manifold Sigma such that pi_1(Sigma) is cyclic. If infinity is not a strict boundary slope, then the diameter of the set of strict boundary slopes of…

In this paper, we present a nonlinear least-squares fitting algorithm using B-splines with free knots. Since its performance strongly depends on the initial estimation of the free parameters (i.e. the knots), we also propose a fast and…

We construct a new type of geometric knot theory, plumbers' knots, and solve the problems of distinguishing and enumerating such knots at a fixed level of complexity. (v2) Minor edits, added theorem 3.18. (v3) Substantial revisions,…

For a positive integer $n\ge 3$, the collection of $n$-sided polygons embedded in $3$-space defines the space of geometric knots. We will consider the subspace of equilateral knots, consisting of embedded $n$-sided polygons with unit length…

A popular method in combinatorial optimization is to express polytopes P, which may potentially have exponentially many facets, as solutions of linear programs that use few extra variables to reduce the number of constraints down to a…

We introduce an algorithm which estimates the number of circuits in a graph as a function of their length. This approach provides analytical results for the typical entropy of circuits in sparse random graphs. When applied to real-world…

A long standing conjecture states that the ropelength of any alternating knot is at least proportional to its crossing number. In this paper we prove that this conjecture is true. That is, there exists a constant $b_0>0$ such that $R(K)\ge…

We show that the problem of constructing a real rational knot of a reasonably low degree can be reduced to an algebraic problem involving the pure braid group: expressing an associated element of the pure braid group in terms of the…

In this paper we propose a novel efficient algorithm for calculating winding numbers, aiming at counting the number of roots of a given polynomial in a convex region on the complex plane. This algorithm can be used for counting and…