Related papers: Knotting statistics for polygons in lattice tubes

The unknotting number of a positive braid with n strands and k intersections is known to be equal to (k-n+1)/2. We consider Lorenz knots (which are positive braids) and, using a different method, find their unknotting numbers in terms of…

We study the inflated phase of two dimensional lattice polygons, both convex and column-convex, with fixed area A and variable perimeter, when a weight \mu^t \exp[- Jb] is associated to a polygon with perimeter t and b bends. The mean…

We develop a reinforcement learning pipeline for simplifying knot diagrams. A trained agent learns move proposals and a value heuristic for navigating Reidemeister moves. The pipeline applies to arbitrary knots and links; we test it on…

Compact polymers are self-avoiding random walks which visit every site on a lattice. This polymer model is used widely for studying statistical problems inspired by protein folding. One difficulty with using compact polymers to perform…

Tissue growth underpins a wide array of biological and developmental processes, and numerical modeling of growing systems has been shown to be a useful tool for understanding these processes. However, the phenomena that can be captured are…

We study two simple modifications of self-avoiding polygons. Osculating polygons are a super-set in which we allow the perimeter of the polygon to touch at a vertex. Neighbour-avoiding polygons are only allowed to have nearest neighbour…

We develop a topological model of knots and links arising from a single (or multiple processive) round(s) of recombination starting with an unknot, unlink, or (2,m)-torus knot or link substrate. We show that all knotted or linked products…

It is a major unsolved problem as to whether unknot recognition - that is, testing whether a given closed loop in R^3 can be untangled to form a plain circle - has a polynomial time algorithm. In practice, trivial knots (which can be…

This paper contains linear systems of equations which can distinguish knots without knot invariants. Let $M_n$ be the topological moduli space of all n-component string links and such that a fixed projection into the plane is an immersion.…

We prove the existence of knotted and linked thin vortex tubes for steady solutions to the incompressible Euler equation in R^3. More precisely, given a finite collection of (possibly linked and knotted) disjoint thin tubes in R^3, we show…

Given a knot $K$ in a closed orientable manifold $M$ we define the growth rate of the tunnel number of $K$ to be $gr_t(K) = \limsup_{n \to \infty} \frac{t(nK) - n t(K)}{n-1}$. As our main result we prove that the Heegaard genus of $M$ is…

We calculate exponential growth constants describing the asymptotic behavior of several quantities enumerating classes of orientations of arrow variables on the bonds of several types of directed lattice strip graphs $G$ of finite width and…

We study a family of scale-invariant $p$-densities of knot types in $R^3$, defined as the ratio of length to an $L^p$-type spread of pairwise distances along a curve. The first point of the paper is that the unconstrained theory has a…

We consider localised bulging/necking in an inflated hyperelastic membrane tube with closed ends. We first show that the initiation pressure for the onset of localised bulging is simply the limiting pressure in uniform inflation when the…

The first algorithm for sampling the space of thick equilateral knots, as a function of thickness, will be described. This algorithm is based on previous algorithms of applying random reflections. To prove the existence of the algorithm, we…

We prove a constant term theorem which is useful for finding weight polynomials for Ballot/Motzkin paths in a strip with a fixed number of arbitrary `decorated' weights as well as an arbitrary `background' weight. Our CT theorem, like…

How many $n$-step polygons exist that contain a given vertex of an infinite quasi-transitive graph $G$? The exponential growth rate of such polygons is identified as the connective constant when $G$ has sub-exponential growth and possesses…

We use an entropy based method to study two graph maximization problems. We upper bound the number of matchings of fixed size $\ell$ in a $d$-regular graph on $N$ vertices. For $\frac{2\ell}{N}$ bounded away from 0 and 1, the logarithm of…

We present computer simulations of a dynamic Monte Carlo algorithm for polymer chains on the FCC lattice which takes explicitly into account the possibility to overcome topological constraints by controlling the rate at which nearby polymer…

We obtain the entropy of flexible linear chains composed of M monomers placed on the square lattice using a transfer matrix approach. An excluded volume interaction is included by considering the chains to be self-and mutually avoiding, and…