On trivial words in finitely presented groups

We propose a numerical method for studying the cogrowth of finitely presented groups. To validate our numerical results we compare them against the corresponding data from groups whose cogrowth series are known exactly. Further, we add to the set of such groups by finding the cogrowth series for Baumslag-Solitar groups $\mathrm{BS}(N,N) =$ and prove that their cogrowth rates are algebraic numbers.Comment: This article has been rewritten as two separate papers, with improved exposition. The new papers are arXiv:1309.4184 and arXiv:1312.572

Scaling of the atmosphere of self-avoiding walks

The number of free sites next to the end of a self-avoiding walk is known as the atmosphere. The average atmosphere can be related to the number of configurations. Here we study the distribution of atmospheres as a function of length and how the number of walks of fixed atmosphere scale. Certain bounds on these numbers can be proved. We use Monte Carlo estimates to verify our conjectures. Of particular interest are walks that have zero atmosphere, which are known as trapped. We demonstrate that these walks scale in the same way as the full set of self-avoiding walks, barring an overall constant factor

On the universality of knot probability ratios

Let $p_n$ denote the number of self-avoiding polygons of length $n$ on a regular three-dimensional lattice, and let $p_n(K)$ be the number which have knot type $K$. The probability that a random polygon of length $n$ has knot type $K$ is $p_n(K)/p_n$ and is known to decay exponentially with length. Little is known rigorously about the asymptotics of $p_n(K)$, but there is substantial numerical evidence that $p_n(K)$ grows as $p_n(K) \simeq \, C_K \, \mu_\emptyset^n \, n^{\alpha-3+N_K}$, as $n \to \infty$, where $N_K$ is the number of prime components of the knot type $K$. It is believed that the entropic exponent, $\alpha$, is universal, while the exponential growth rate, $\mu_\emptyset$, is independent of the knot type but varies with the lattice. The amplitude, $C_K$, depends on both the lattice and the knot type. The above asymptotic form implies that the relative probability of a random polygon of length $n$ having prime knot type $K$ over prime knot type $L$ is $\frac{p_n(K)/p_n}{p_n(L)/p_n} = \frac{p_n(K)}{p_n(L)} \simeq [ \frac{C_K}{C_L} ]$. In the thermodynamic limit this probability ratio becomes an amplitude ratio; it should be universal and depend only on the knot types $K$ and $L$. In this letter we examine the universality of these probability ratios for polygons in the simple cubic, face-centered cubic, and body-centered cubic lattices. Our results support the hypothesis that these are universal quantities. For example, we estimate that a long random polygon is approximately 28 times more likely to be a trefoil than be a figure-eight, independent of the underlying lattice, giving an estimate of the intrinsic entropy associated with knot types in closed curves.Comment: 8 pages, 6 figures, 1 tabl

BFACF-style algorithms for polygons in the body-centered and face-centered cubic lattices

In this paper the elementary moves of the BFACF-algorithm for lattice polygons are generalised to elementary moves of BFACF-style algorithms for lattice polygons in the body-centred (BCC) and face-centred (FCC) cubic lattices. We prove that the ergodicity classes of these new elementary moves coincide with the knot types of unrooted polygons in the BCC and FCC lattices and so expand a similar result for the cubic lattice. Implementations of these algorithms for knotted polygons using the GAS algorithm produce estimates of the minimal length of knotted polygons in the BCC and FCC lattices

Simple Asymmetric Exclusion Model and Lattice Paths: Bijections and Involutions

We study the combinatorics of the change of basis of three representations of the stationary state algebra of the two parameter simple asymmetric exclusion process. Each of the representations considered correspond to a different set of weighted lattice paths which, when summed over, give the stationary state probability distribution. We show that all three sets of paths are combinatorially related via sequences of bijections and sign reversing involutions.Comment: 28 page

Lattice Knots in a Slab

In this paper the number and lengths of minimal length lattice knots confined to slabs of width $L$, is determined. Our data on minimal length verify the results by Sharein et.al. (2011) for the similar problem, expect in a single case, where an improvement is found. From our data we construct two models of grafted knotted ring polymers squeezed between hard walls, or by an external force. In each model, we determine the entropic forces arising when the lattice polygon is squeezed by externally applied forces. The profile of forces and compressibility of several knot types are presented and compared, and in addition, the total work done on the lattice knots when it is squeezed to a minimal state is determined

Layering transitions for adsorbing polymers in poor solvents

An infinite hierarchy of layering transitions exists for model polymers in solution under poor solvent or low temperatures and near an attractive surface. A flat histogram stochastic growth algorithm known as FlatPERM has been used on a self- and surface interacting self-avoiding walk model for lengths up to 256. The associated phases exist as stable equilibria for large though not infinite length polymers and break the conjectured Surface Attached Globule phase into a series of phases where a polymer exists in specified layer close to a surface. We provide a scaling theory for these phases and the first-order transitions between them.Comment: 4 pages, 4 figure

The Compressibility of Minimal Lattice Knots

The (isothermic) compressibility of lattice knots can be examined as a model of the effects of topology and geometry on the compressibility of ring polymers. In this paper, the compressibility of minimal length lattice knots in the simple cubic, face centered cubic and body centered cubic lattices are determined. Our results show that the compressibility is generally not monotonic, but in some cases increases with pressure. Differences of the compressibility for different knot types show that topology is a factor determining the compressibility of a lattice knot, and differences between the three lattices show that compressibility is also a function of geometry.Comment: Submitted to J. Stat. Mec