Related papers: Scaling behavior of knotted random polygons and se…
We discuss the entropy of a circular polymer under a topological constraint. We call it the {\it topological entropy} of the polymer, in short. A ring polymer does not change its topology (knot type) under any thermal fluctuations. Through…
We use Brownian dynamics simulations and advanced topological profiling methods to characterize the out-of-equilibrium evolution of self-entanglement in linear polymers confined into nano-channels and under periodic compression. We…
We study by Monte Carlo simulations a model of knotted polymer ring adsorbing onto an impenetrable, attractive wall. The polymer is described by a self-avoiding polygon (SAP) on the cubic lattice. We find that the adsorption transition…
We estimate by Monte Carlo simulations the configurational entropy of $N$-steps polygons in the cubic lattice with fixed knot type. By collecting a rich statistics of configurations with very large values of $N$ we are able to analyse the…
The probability of a random polygon (or a ring polymer) having a knot type $K$ should depend on the complexity of the knot $K$. Through computer simulation using knot invariants, we show that the knotting probability decreases exponentially…
Punctured polygons are polygons with internal holes which are also polygons. The external and internal polygons are of the same type, and they are mutually as well as self-avoiding. Based on an assumption about the limiting area…
Entangled states are ubiquitous amongst fibrous materials, whether naturally occurring (keratin, collagen, DNA) or synthetic (nanotube assemblies, elastane). A key mechanical characteristic of these systems is their ability to reorganise in…
Anomalously strong finite-size effects have been observed for the mean square radius of gyration $R^2_K$ of Gaussian random polygons with a fixed knot $K$ as a function of the number $N$ of polygonal nodes. Through computer simulations with…
Several kinds of walks on complex networks are currently used to analyze search and navigation in different systems. Many analytical and computational results are known for random walks on such networks. Self-avoiding walks (SAWs) are…
The interplay of topological constraints and persistence length of ring polymers in their own melt is investigated by means of dynamical Monte Carlo simulations of a three dimensional lattice model. We ask if the results are consistent with…
The renormalization group and operator product expansion are applied to the model of a passive scalar quantity advected by the Gaussian self-similar velocity field with finite, and not small, correlation time. The inertial-range energy…
We have developed a parallel algorithm that allows us to enumerate the number of self-avoiding polygons on the square lattice to perimeter length 110. We have also extended the series for the first 10 area-weighted moments and the radius of…
The best practical techniques for exact solution of instances of the constrained maximum-entropy sampling problem, a discrete-optimization problem arising in the design of experiments, are via a branch-and-bound framework, working with a…
Unconcatenated, unknotted polymer rings in the melt are subject to strong interactions with neighboring chains due to the presence of topological constraints. We study this by computer simulation using the bond-fluctuation algorithm for…
A model of the passive vector quantity advected by a Gaussian time-decorrelated self-similar velocity field is studied; the effects of pressure and large-scale anisotropy are discussed. The inertial-range behavior of the pair correlation…
We examine connections between combinatorial notions that arise in machine learning and topological notions in cubical/simplicial geometry. These connections enable to export results from geometry to machine learning. Our first main result…
We introduce a two-dimensional lattice model for the description of knotted polymer rings. A polymer configuration is modeled by a closed polygon drawn on the square diagonal lattice, with possible crossings describing pairs of strands of…
A Gelfand-Tsetlin scheme of depth N is a triangular array with m integers at level m, m=1,...,N, subject to certain interlacing constraints. We study the ensemble of uniformly random Gelfand-Tsetlin schemes with arbitrary fixed N-th row. We…
We study high order random walks in high dimensional expanders; namely, in complexes which are local spectral expanders. Recent works have studied the spectrum of high order walks and deduced fast mixing. However, the spectral gap of high…
A physical interpretation of the rope simulated by the SONO algorithm is presented. Properties of the tight polygonal knots delivered by the algorithm are analyzed. An algorithm for bounding the ropelength of a smooth inscribed knot is…