Related papers: The entropic cost to tie a knot
In the infinite configuration network the links between nodes are assigned randomly with the only restriction that the degree distribution has to match a predefined function. This work presents a simple equation that gives for an arbitrary…
For all n > 0 there is a homomorphism from the smooth concordance group of knots in dimension 2n + 1 to an algebraically defined group called the rational algebraic concordance group. This algebraic concordance group splits as a direct sum…
Given a (genus 2) cube-with-holes M, i.e. the complement in S^3 of a handlebody H, we relate intrinsic properties of M (like its cut number) with extrinsic features depending on the way the handlebody H is knotted in S^3. Starting from a…
The component-by-component construction is the standard method of finding good lattice rules or polynomial lattice rules for numerical integration. Several authors have reported that in numerical experiments the generating vector sometimes…
Simple closed curves in the plane can be mapped to nontrivial knots under the action of origami foldings that allow the paper to self-intersect. We show all tame knot types may be produced in this manner, motivating the development of a new…
This thesis develops some general calculational techniques for finding the orders of knots in the topological concordance group C. The techniques currently available in the literature are either too theoretical, applying to only a small…
Simulations of knotting and unknotting in polymers or other filaments rely on random processes to facilitate topological changes. Here we introduce a method of \textit{topological steering} to determine the optimal pathway by which a…
We investigate the effects of topological constraints (entanglements) on two dimensional polymer loops in the dense phase, and at the collapse transition (Theta point). Previous studies have shown that in the dilute phase the entangled…
For each sequence of polynomials, P=(p_1(t),p_2(t),...), we define a characteristic series of groups, called the derived series localized at P. Given a knot K in S^3, such a sequence of polynomials arises naturally as the orders of certain…
We investigate the probability for appearance of knots in self-avoiding loops (SALs) on a cubic lattice. A set of N-step loops is generated by attempting to combine pairs of (N/2)-step self-avoiding walks constructed by a dimerization…
Besides mathematical interest, knots and knot theory have important applications in physics, chemistry, and biology. Stasiak and colleagues devised a constructive method for a knot "energy" using a Metropolis Monte Carlo algorithm to…
Using methods of high performance computing, we have found indications that knotlike structures appear as stable finite energy solitons in a realistic 3+1 dimensional model. We have explicitly simulated the unknot and trefoil…
It has been known for some time that the topological entropy is a nondecreasing function of the parameter in the real quadratic family, which corresponds to the intuitive idea that more nonlinearity induces more complex dynamical behavior.…
A slope $p/q$ is said to be characterizing for a knot $K$ if the homeomorphism type of the $p/q$-Dehn surgery along $K$ determines the knot up to isotopy. Extending previous work of Lackenby and McCoy on hyperbolic and torus knots…
Lattice rules and polynomial lattice rules are quadrature rules for approximating integrals over the $s$-dimensional unit cube. Since no explicit constructions of such quadrature methods are known for dimensions $s > 2$, one usually has to…
A {\it stuck knot} is a knot diagram containing designated crossings, called {\it stuck crossings}, whose incident strands are required to remain locally non-separable. These rigidity constraints restrict the allowable ambient isotopies and…
We initiate the study of classical knots through the homotopy class of the n-th evaluation map of the knot, which is the induced map on the compactified n-point configuration space. Sending a knot to its n-th evaluation map realizes the…
Entropy alone can self-assemble hard particles into colloidal crystals of remarkable complexity whose structures are the same as atomic and molecular crystals, but with larger lattice spacings. Although particle-based molecular simulation…
We introduce an exactly solvable lattice model that reveals a universal finite-size scaling law for configurational entropy driven purely by geometry. Using exact enumeration via Burnside's lemma, we compute the entropy for diverse 1D, 2D,…
We model the typical behavior of knots and links using grid diagrams. Links are ubiquitous in the sciences, and their "normal" or "typical" behavior is of significant importance in understanding situations such as the topological state of…