arXiv subjects

Andrew Rechnitzer

Publications and source records attributed to Andrew Rechnitzer.

25 records · Page 2Linked to original sources

arXiv2009

Random subgroups of Thompson's group $F$

We consider random subgroups of Thompson's group $F$ with respect to two natural stratifications of the set of all $k$ generator subgroups. We find that the isomorphism classes of subgroups which occur with positive density are not the same for the two stratifications. We give the first known examples of {\em persistent} subgroups, whose isomorphism classes occur with positive density within the set of $k$-generator subgroups, for all sufficiently large $k$. Additionally, Thompson's group provides the first example of a group without a generic isomorphism class of subgroup. Elements of $F$ are represented uniquely by reduced pairs of finite rooted binary trees. We compute the asymptotic growth rate and a generating function for the number of reduced pairs of trees, which we show is D-finite and not algebraic. We then use the asymptotic growth to prove our density results.

math.GR↗

arXiv2008

Exact perimeter generating function for a model of punctured staircase polygons

We have derived the perimeter generating function of a model of punctured staircase polygons in which the internal staircase polygon is rotated by a 90degree angle with respect to the outer staircase polygon. In one approach we calculated a long series expansion for the problem and found that all the terms in the generating function can be reproduced from a linear Fuchsian differential equation of order 4. We then solved this ODE and found a closed form expression for the generating function. This is a highly unusual and most fortuitous result since ODEs of such high order very rarely permit a closed form solution. In a second approach we proved the result for the generating function exactly using combinatorial arguments. This latter solution allows many generalisations including to models with other types of punctures and to a model with any fixed number of nested rotated staircase punctures.

cond-mat.stat-mech↗

arXiv2007

Two Non-holonomic Lattice Walks in the Quarter Plane

We present two classes of random walks restricted to the quarter plane whose generating function is not holonomic. The non-holonomy is established using the iterated kernel method, a recent variant of the kernel method. This adds evidence to a recent conjecture on combinatorial properties of walks with holonomic generating functions. The method also yields an asymptotic expression for the number of walks of length n.

math.CO↗

arXiv2005

Haruspicy 2: The anisotropic generating function of self-avoiding polygons not D-finite

We prove that the anisotropic generating function of self-avoiding polygons is not a D-finite function - proving a conjecture of Guttmann and Enting. This result is also generalised to self-avoiding polygons on hypercubic lattices. Using the haruspicy techniques developed in an earlier paper we are also prove the form of the coefficients of the anisotropic generating function, which was first conjectured by Guttmann and Enting.

math.CO↗

arXiv2004

Self-avoiding walks and trails on the 3.12 lattice

We find the generating function of self-avoiding walks and trails on a semi-regular lattice called the $3.12^2$ lattice in terms of the generating functions of simple graphs, such as self-avoiding walks, polygons and tadpole graphs on the hexagonal lattice. Since the growth constant for these graphs is known on the hexagonal lattice we can find the growth constant for both walks and trails on the $3.12^2$ lattice. A result of Watson then allows us to find the generating function and growth constant of neighbour-avoiding walks on the covering lattice of the $3.12^2$ lattice which is tetra-valent. A mapping into walks on the covering lattice allows us to obtain improved bounds on the growth constant for a range of lattices.

cond-mat.stat-mech↗

arXiv2004

Haruspicy 3: The directed bond-animal generating function is not D-finite

While directed site-animals have been solved on several lattices, directed bond-animals remain unsolved on any non-trivial lattice. In this paper we demonstrate that the anisotropic generating function of directed bond-animals on the square lattice is fundamentally different from that of directed site-animals in that it is not differentiably finite. We also extend this result to directed bond-animals on hypercubic lattices. This indicates that directed bond-animals are unlikely to be solved by similar methods to those used in the solution of directed site-animals. It also implies that a solution cannot by conjectured using computer packages such as GFUN or differential approximants.

math.CO↗

arXiv2004

Polymer Simulations with a flat histogram stochastic growth algorithm

We present Monte Carlo simulations of lattice models of polymers. These simulations are intended to demonstrate the strengths of a powerful new flat histogram algorithm which is obtained by adding microcanonical reweighting techniques to the pruned and enriched Rosenbluth method (PERM).

cond-mat.soft↗