Related papers: Ropelength-minimizing concentric helices and non-a…

The viscous flow of polymer chains in dense melts is dominated by topological constraints whenever the single chain contour length, N, becomes larger than the characteristic scale Ne, defining comprehensively the macroscopic rheological…

We show that any non-minimal bridge decomposition of a torus knot is stabilized and that $n$-bridge decompositions of a torus knot are unique for any integer $n$. This implies that a knot in a bridge position is a torus knot if and only if…

Every knot can be embedded in the union of finitely many half planes with a common boundary line in such a way that the portion of the knot in each half plane is a properly embedded arc. The minimal number of such half planes is called the…

We propose that clusters interconnected with network topologies having minimal mean path length will increase their overall performance for a variety of applications. We approach our heuristic by constructing clusters of up to 36 nodes…

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

Weakly generalised alternating knots are knots with an alternating projection onto a closed surface in a compact irreducible 3-manifold, and they share many hyperbolic geometric properties with usual alternating knots. For example, usual…

This survey reviews Kauffman's model of folded ribbon knots: knots made of a thin strip of paper folded flat in the plane. The ribbonlength is the length to width ratio of such a ribbon, and the ribbonlength problem asks to minimize the…

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

Knotted and tangled structures frequently appear in physical fields, but so do mechanisms for untying them. To understand how this untying works, we simulate the behavior of 1,458 superfluid vortex knots of varying complexity and scale in…

We are giving tables of quasi-alternating knots with $8\le n \le 12$ crossings. As the obstructions for a knot to be quasialternating we used homology thickness with regards to Khovanov homology, odd homology, and Heegaard-Floer homology…

Topological entanglements are abundant, and often detrimental, in polymeric systems in biology and materials science. Here we theoretically investigate the topological simplification of knots by diffusing slip-links (SLs), which may…

We use computer simulations to compare the dynamical behaviour of torus and even-twist knots in polymers under tension. The knots diffuse through a mechanism similar to reptation. Their friction coefficients grow linearly with average knot…

We prove a version of symmetric criticality for ropelength-critical knots. Our theorem implies that a knot or link with a symmetric representative has a ropelength-critical configuration with the same symmetry. We use this to construct new…

We study the interplay between entropy and topological constraints for a polymer chain in which sliding rings (slip-links) enforce pair contacts between monomers. These slip-links divide a closed ring polymer into a number of sub-loops…

An analysis of extensive simulations of interacting self-avoiding polygons on cubic lattice shows that the frequencies of different knots realized in a random, collapsed polymer ring decrease as a negative power of the ranking order, and…

In this paper the number and lengths of minimal length lattice knots confined to slabs of width $L$, is determined. Our data on minimal length verify the results by Sharein et.al. (2011) for the similar problem, expect in a single case,…

The ropelength of a knot or link is the minimal number of inches of 1-inch-thick rope that it takes to tie it. The relationship of this measurement to knot and link invariants has been studied by various authors. We give the first results…

We use a multivariate central limit theorem (CLT) to study the distribution of random geometric graphs (RGGs) on the cube and torus in the high-dimensional limit with general node distributions. We find that the distribution of RGGs on the…

We enumerate and show tables of minimal diagrams for all prime knots up to the triple-crossing number equal to five. We derive a minimal generating set of oriented moves connecting triple-crossing diagrams of the same oriented knot. We also…

Algorithm of construction of all knots, links with given number of crosses on diagram of knot, link is offered. This algorithm is based on simple proposition, that there is a representation of knot (link) as closure of braid with n threads…