Related papers: Scaling behavior of knotted random polygons and se…
Given a knot in 3-space, one can associate a sequence of Laurrent polynomials, whose $n$th term is the $n$th colored Jones polynomial. The Generalized Volume Conjecture states that the value of the $n$-th colored Jones polynomial at $\exp(2…
The number of configurations of a polymer is reduced in the presence of a barrier or an obstacle. The resulting loss of entropy adds a repulsive component to other forces generated by interaction potentials. When the obstructions are scale…
We consider polymers in which M randomly selected pairs of monomers are restricted to be in contact. Analytical arguments and numerical simulations show that an ideal (Gaussian) chain of N monomers remains expanded as long as M<<N; its mean…
Understanding and controlling the shape of thin, soft objects has been the focus of significant research efforts among physicists, biologists, and engineers in the last decade. These studies aim to utilize advanced materials in novel,…
Topological entanglements in polymers are mimicked by sliding rings (slip-links) which enforce pair contacts between monomers. We study the force-extension curve for linear polymers in which slip-links create additional loops of variable…
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…
Symmetry protected topological (SPT) phases of bosons in $d$ spatial dimensions have been characterized by the action of the protecting global symmetry $G$ on their boundary. The symmetry acts on the boundary in a way that would be…
We consider a model of a D-dimensional tethered manifold interacting by excluded volume in R^d with a single point. Use of intrinsic distance geometry provides a rigorous definition of the analytic continuation of the perturbative expansion…
For a large number of random constraint satisfaction problems, such as random k-SAT and random graph and hypergraph coloring, there are very good estimates of the largest constraint density for which solutions exist. Yet, all known…
We define a new ensemble for self-avoiding walks in the upper half-plane, the fixed irredicible bridge ensemble, by considering self-avoiding walks in the upper half-plane up to their $n$-th bridge height, $Y_n$, and scaling the walk by…
Given a topological space X denote by exp_k(X) the space of non-empty subsets of X of size at most k, topologised as a quotient of X^k. This space may be regarded as a union over 0 < l < k+1 of configuration spaces of l distinct unordered…
The statistics of a long closed self-avoiding walk (SAW) or polymer ring on a $ d $-dimensional lattice obeys hyperscaling. The combination $ p_N \left\langle R^2 \right\rangle^{ d/2}_N\mu^{ -N}, $ (where $ p_N $ is the number of…
Let K be a tame knot with irreducible exterior M(K) in a closed, connected, orientable 3--manifold Sigma such that pi_1(Sigma) is cyclic. If infinity is not a strict boundary slope, then the diameter of the set of strict boundary slopes of…
A symmetrically-buckled arch whose boundaries are clamped at an angle has two stable equilibria: an inverted and a natural state. When the distance between the clamps is increased (i.e. the confinement is decreased) the system snaps from…
We consider the expected value for the total curvature of a random closed polygon. Numerical experiments have suggested that as the number of edges becomes large, the difference between the expected total curvature of a random closed…
We study the growth of random networks under a constraint that the diameter, defined as the average shortest path length between all nodes, remains approximately constant. We show that if the graph maintains the form of its degree…
The CP^3 spin model is simulated at large correlation lengths in two dimensions. An overrelaxation algorithm is employed which yields reduced critical slowing down with dynamical exponents z around unity. We compare our results with recent…
We consider random rectangles in $\mathbb{R}^2$ that are distributed according to a Poisson random measure, i.e., independently and uniformly scattered in the plane. The distributions of the length and the width of the rectangles are…
A complex network is said to show topological isotropy if the topological structure around a particular node looks the same in all directions of the whole network. Topologically anisotropic networks are those where the local neighborhood…
A convenient measure of a map or flow's chaotic action is the topological entropy. In many cases, the entropy has a homological origin: it is forced by the topology of the space. For example, in simple toral maps, the topological entropy is…