Related papers: Knot Probability for Self-Avoiding Loops on a Cubi…
We study a model of semi-flexible self-avoiding trails, where the lattice paths are constrained to visit each lattice edge at most once, with configurations weighted by the number of collisions, crossings and bends, on a Husimi lattice…
We have applied a new gauge-invariant, noncompact, Monte Carlo method to simulate $U(1)$, $SU(2)$, and $SU(3)$ gauge theories on $8^4$ and $12^4$ lattices. The Creutz ratios of the Wilson loops agree with the exact results for $U(1)$ for…
The goal of this paper is to discuss the possibility of finding an algorithm that can give all distinct knots up to a desired complexity. Two such algorithms are presented, one based on projections on a plane, the other on closed…
In 2010, Duminil-Copin and Smirnov proved a long-standing conjecture of Nienhuis, made in 1982, that the growth constant of self-avoiding walks on the hexagonal (a.k.a. honeycomb) lattice is $\mu=\sqrt{2+\sqrt{2}}.$ A key identity used in…
For $\ell >1$, we develop $L^{(2)}$-signature obstructions for $(4\ell-3)$-dimensional knots with metabelian knot groups to be doubly slice. For each $\ell>1$, we construct an infinite family of knots on which our obstructions are non-zero,…
We show that the average size of self-avoiding polygons (SAP) with a fixed knot is much larger than that of no topological constraint if the excluded volume is small and the number of segments is large. We call it topological swelling. We…
Let $\mbox{Len}(K)$ be the minimum length of a knot on the cubic lattice (namely the minimum length necessary to construct the knot in the cubic lattice). This paper provides upper bounds for $\mbox{Len}(K)$ of a nontrivial knot $K$ in…
The role of the topology and its relation with the geometry of biopolymers under different physical conditions is a nontrivial and interesting problem. Aiming at understanding this issue for a related simpler system, we use Monte Carlo…
We have extended the enumeration of self-avoiding walks on the Manhattan lattice from 28 to 53 steps and for self-avoiding polygons from 48 to 84 steps. Analysis of this data suggests that the walk generating function exponent gamma =…
Single linear polymer chains in dilute solutions under good solvent conditions are studied by Monte Carlo simulations with the pruned-enriched Rosenbluth method up to the chain length $N \sim {\cal O}(10^4)$. Based on the standard simple…
We prove several rigorous results about the asymptotic behaviour of the numbers of tadpoles (or lassos) embedded in a lattice, including cases where the head is subject to a constraint like being unknotted, or where the tail pierces the…
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…
In the past decade, a lot of attention has been devoted to the enumera-tion of walks with prescribed steps confined to a convex cone. In two dimensions, this means counting walks in the first quadrant of the plane (possibly after a linear…
We have studied self-avoiding walks contained within an $L \times L$ square whose end-points can lie anywhere within, or on, the boundaries of the square. We prove that such walks behave, asymptotically, as walks crossing a square (WCAS),…
We explain a unified approach to a study of ballistic phase for a large family of self-interacting random walks with a drift and self-interacting polymers with an external stretching force. The approach is based on a recent version of the…
Knot-based, sparse Gaussian processes have enjoyed considerable success as scalable approximations to full Gaussian processes. Problems can occur, however, when knot selection is done by optimizing the marginal likelihood. For example, the…
We introduce a new class of models for polymer collapse, given by random walks on regular lattices which are weighted according to multiple site visits. A Boltzmann weight $\omega_l$ is assigned to each $(l+1)$-fold visited lattice site,…
Tangles of string typically become knotted, from macroscopic twine down to long-chain macromolecules such as DNA. Here we demonstrate that knotting also occurs in quantum wavefunctions, where the tangled filaments are vortices (nodal…
We develop an approach for performing scaling analysis of $N$-step Random Walks (RWs). The mean square end-to-end distance, $\langle\vec{R}_{N}^{2}\rangle$, is written in terms of inner persistence lengths (IPLs), which we define by the…
Using a lattice model of polymers in a tube, we define one way to characterise different configurations of a given knot as either "local" or "non-local" and, for several ring polymer models, we provide both theoretical and numerical…