arXiv subjects

Anthony J. Guttmann

Publications and source records attributed to Anthony J. Guttmann.

At least 19 recordsLinked to original sources

arXiv2026

Enumerating Pattern-Avoiding Involutions using Combinatorial Exploration

The enumeration of pattern-avoiding permutations has been a popular area of study over the past several decades, but comparatively little attention has been given to the topic of pattern-avoiding involutions. In this paper, we derive the algebraic generating functions of two Wilf-equivalence classes of involutions avoiding a single pattern of length $4$, $\operatorname{Av^I}(2431)$ and $\operatorname{Av^I}(3421)$. We then adapt the Mosaic method, a fast counting algorithm for permutations, to count involutions and apply it to substantially extend the known initial terms of the counting sequences for the remaining two Wilf-equivalence classes avoiding a pattern of length $4$, $\operatorname{Av^I}(1324)$ and $\operatorname{Av^I}(4231)$. Based on these extended sequences, we empirically analyze the asymptotic behavior of the counting sequences of these two classes.

math.CO↗

arXiv2026

$k$-Convex Polyominoes by Semi-perimeter

We give the conjectured solution for the generating function of $k$-convex polyominoes, enumerated by semi-perimeter. The solution was obtained from the analysis of enumeration data that we generated.

math.CO↗

arXiv2026

k-Convex Polyominoes by Semi-perimeter

We give the conjectured solution for the generating function of k-convex polyominoes, enumerated by semi-perimeter. The solution was obtained from the analysis of enumeration data that we generated.

cs.DM↗

arXiv2021

The Enumeration of Prudent Polygons by Area and its Unusual Asymptotics

Prudent walks are special self-avoiding walks that never take a step towards an already occupied site, and \emph{$k$-sided prudent walks} (with $k=1,2,3,4$) are, in essence, only allowed to grow along $k$ directions. Prudent polygons are prudent walks that return to a point adjacent to their starting point. Prudent walks and polygons have been previously enumerated by length and perimeter (Bousquet-Mélou, Schwerdtfeger; 2010). We consider the enumeration of \emph{prudent polygons} by \emph{area}. For the 3-sided variety, we find that the generating function is expressed in terms of a $q$-hypergeometric function, with an accumulation of poles towards the dominant singularity. This expression reveals an unusual asymptotic structure of the number of polygons of area $n$, where the critical exponent is the transcendental number $\log_23$ and and the amplitude involves tiny oscillations. Based on numerical data, we also expect similar phenomena to occur for 4-sided polygons. The asymptotic methodology involves an original combination of Mellin transform techniques and singularity analysis, which is of potential interest in a number of other asymptotic enumeration problems.

math.CO↗

arXiv2021

Classical length-5 pattern-avoiding permutations

We have made a systematic numerical study of the 16 Wilf classes of length-5 classical pattern-avoiding permutations from their generating function coefficients. We have extended the number of known coefficients in fourteen of the sixteen classes. Careful analysis, including sequence extension, has allowed us to estimate the growth constant of all classes, and in some cases to estimate the sub-dominant power-law term associated with the exponential growth. In six of the sixteen classes we find the familiar power-law behaviour, so that the coefficients behave like $s_n \sim C \cdot μ^n \cdot n^g,$ while in the remaining ten cases we find a stretched exponential as the most likely sub-dominant term, so that the coefficients behave like $s_n \sim C \cdot μ^n \cdot μ_1^{n^σ} \cdot n^g,$ where $0 < σ< 1.$ We have also classified the 120 possible permutations into the 16 distinct classes. We give compelling numerical evidence, and in one case a proof, that all 16 Wilf-class generating function coefficients can be represented as moments of a non-negative measure on $[0,\infty).$ Such sequences are known as {\em Stieltjes moment sequences}. They have a number of nice properties, such as log-convexity, which can be used to provide quite strong rigorous lower bounds. Stronger bounds still can be established under plausible monotonicity assumptions about the terms in the continued-fraction expansion of the generating functions implied by the Stieltjes property. In this way we provide strong (non-rigorous) lower bounds to the growth constants, which are sometimes within a few percent of the exact value.

math.CO↗

arXiv2020

SanD primes and numbers

We define S(um)anD(ifference) numbers as ordered pairs $(m,\, m+Δ)$ such that the digital-sum $DS(m(m+Δ))=Δ.$ We consider both the decimal and the binary case. If both $m$ and $m+Δ$ are prime numbers, we refer to SanD {\em primes}. We show that the number of (decimal-based) SanD numbers less than $x$ grows as $c1\cdot x,$ where $c1 = 2/3,$ while the number of SanD primes less than $x$ grows as $c2\cdot x/\log^2{x},$ where $c2 = 3/4.$ Due to the quasi-fractal nature of the digital-sum function, convergence is both slow and erratic compared to twin primes, which, apart from the constant, have the same leading asymptotics.

math.CA↗

arXiv2019

A Conjectured Integer Sequence Arising From the Exponential Integral

Let $f_0(z) = \exp(z/(1-z))$, $f_1(z) = \exp(1/(1-z))E_1(1/(1-z))$, where $E_1(x) = \int_x^\infty e^{-t}t^{-1}{\,d}t$. Let $a_n = [z^n]f_0(z)$ and $b_n = [z^n]f_1(z)$ be the corresponding Maclaurin series coefficients. We show that $a_n$ and $b_n$ may be expressed in terms of confluent hypergeometric functions. We consider the asymptotic behaviour of the sequences $(a_n)$ and $(b_n)$ as $n \to \infty$, showing that they are closely related, and proving a conjecture of Bruno Salvy regarding $(b_n)$. Let $ρ_n = a_n b_n$, so $\sum ρ_n z^n = (f_0\,\odot f_1)(z)$ is a Hadamard product. We obtain an asymptotic expansion $2n^{3/2}ρ_n \sim -\sum d_k n^{-k}$ as $n \to \infty$, where the $d_k\in\mathbb Q$, $d_0=1$. We conjecture that $2^{6k}d_k \in \mathbb Z$. This has been verified for $k \le 1000$.

math.NT↗

arXiv2017

1324-avoiding permutations revisited

We give an improved algorithm for counting the number of $1324$-avoiding permutations, resulting in $14$ further terms of the generating function, which is now known for all patterns of length $\le 50$. We re-analyse the generating function and find additional evidence for our earlier conclusion that unlike other classical length-$4$ pattern-avoiding permutations, the generating function does not have a simple power-law singularity, but rather, the number of $1324$-avoiding permutations of length $n$ behaves as \[ B\cdot μ^n \cdot μ_1^{\sqrt{n}} \cdot n^g. \] We estimate $μ=11.600 \pm 0.003$, $μ_1 = 0.0400 \pm 0.0005$, $g = -1.1 \pm 0.1$ while the estimate of $B$ depends sensitively on the precise value of $μ$, $μ_1$ and $g$. This reanalysis provides substantially more compelling arguments for the presence of the stretched exponential term $μ_1^{\sqrt{n}}$.

math.CO↗

arXiv2016

On the growth constant for square-lattice self-avoiding walks

The growth constant for two-dimensional self-avoiding walks on the honeycomb lattice was conjectured by Nienhuis in 1982, and since that time the corresponding results for the square and triangular lattices have been sought. For the square lattice, a possible conjecture was advanced by one of us (AJG) more than 20 years ago, based on the six significant digit estimate available at the time. This estimate has improved by a further six digits over the intervening decades, and the conjectured value continued to agree with the increasingly precise estimates. We discuss the three most successful methods for estimating the growth constant, including the most recently developed Topological Transfer-Matrix method, due to another of us (JLJ). We show this to be the most computationally efficient of the three methods, and by parallelising the algorithm we have estimated the growth constant significantly more precisely, incidentally ruling out the conjecture, which fails in the 12th digit. Our new estimate of the growth constant is $$μ(\mathrm{square}) = 2.63815853032790\, (3).$$

cond-mat.stat-mech↗

arXiv2016

On a square-ice analogue of plane partitions

We study a one-parameter family ($\ell=1,2,3,\ldots$) of configurations that are square-ice analogues of plane partitions. Using an algorithm due to Bratley and McKay, we carry out exact enumerations in order to study their asymptotic behaviour and establish, via Monte Carlo simulations as well as explicit bounds, that the asymptotic behaviour is similar to that of plane partitions. We finally carry out a series analysis and provide independent estimates for the asymptotic behaviour.

cond-mat.stat-mech↗

arXiv2016

Permutations sortable by deques and by two stacks in parallel

Recently Albert and Bousquet-Mélou \cite{AB15} obtained the solution to the long-standing problem of the number of permutations sortable by two stacks in parallel (tsip). Their solution was expressed in terms of functional equations. We show that the equally long-standing problem of the number of permutations sortable by a double-ended queue (deque) can be simply related to the solution of the same functional equations. Subject to plausible, but unproved, conditions, the radius of convergence of both generating functions is the same. Numerical work confirms this conjecture to 10 significant digits. Further numerical work suggests that the coefficients of the deque generating function behave as $κ_d \cdot μ^n \cdot n^{-3/2},$ where $μ= 8.281402207\ldots,$ while the coefficients of the corresponding tsip generating function behave as $κ_p \cdot μ^n \cdot n^γ$ with $γ\approx -2.473.$ The constants $κ_d$ and $κ_p$ are also estimated. {\em Inter alia,} we study the asymptotics of quarter-plane loops, starting and ending at the origin, with weight $a$ given to north-west and east-south turns. The critical point varies continuously with $a,$ while the corresponding exponent variation is found to be continuous and monotonic for $a > -1/2,$ but discontinuous at $a=-1/2.$

math.CO↗

arXiv2015

Compressed self-avoiding walks, bridges and polygons

We study various self-avoiding walks (SAWs) which are constrained to lie in the upper half-plane and are subjected to a compressive force. This force is applied to the vertex or vertices of the walk located at the maximum distance above the boundary of the half-space. In the case of bridges, this is the unique end-point. In the case of SAWs or self-avoiding polygons, this corresponds to all vertices of maximal height. We first use the conjectured relation with the Schramm-Loewner evolution to predict the form of the partition function including the values of the exponents, and then we use series analysis to test these predictions.

math-ph↗

arXiv2015

Three-dimensional terminally attached self-avoiding walks and bridges

We study terminally attached self-avoiding walks and bridges on the simple cubic lattice, both by series analysis and Monte Carlo methods. We provide strong numerical evidence supporting a scaling relation between self-avoiding walks, bridges, and terminally attached self-avoiding walks, and posit that a corresponding amplitude ratio is a universal quantity.

cond-mat.stat-mech↗

arXiv2013

Pulling adsorbed self-avoiding walks from a surface

We consider a self-avoiding walk model of polymer adsorption where the adsorbed polymer can be desorbed by the application of a force, concentrating on the case of the square lattice. Using series analysis methods we investigate the behaviour of the free energy of the system when there is an attractive potential $ε$ with the surface and a force $f$ applied at the last vertex, normal to the surface, and extract the phase boundary between the ballistic and adsorbed phases. We believe this to be exact to graphical accuracy. We give precise estimates of the location of the transition from the free phase to the ballistic phase, which we find to be at $y_c=\exp(f/k_B T_c)=1$, and from the free phase to the adsorbed phase, which we estimate to be at $a_c=\exp(-ε/k_B T_c)=1.775615 \pm 0.000005$. In addition we prove that the phase transition from the ballistic to the adsorbed phase is first order.

cond-mat.stat-mech↗

arXiv2013

The critical fugacity for surface adsorption of self-avoiding walks on the honeycomb lattice is $1+\sqrt{2}$

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 $μ=\sqrt{2+\sqrt{2}}.$ A key identity used in that proof was later generalised by Smirnov so as to apply to a general O(n) loop model with $n\in [-2,2]$ (the case $n=0$ corresponding to SAWs). We modify this model by restricting to a half-plane and introducing a surface fugacity $y$ associated with boundary sites (also called surface sites), and obtain a generalisation of Smirnov's identity. The critical value of the surface fugacity was conjectured by Batchelor and Yung in 1995 to be $y_{\rm c}=1+2/\sqrt{2-n}.$ This value plays a crucial role in our generalized identity, just as the value of growth constant did in Smirnov's identity. For the case $n=0$, corresponding to \saws\ interacting with a surface, we prove the conjectured value of the critical surface fugacity. A crucial part of the proof involves demonstrating that the generating function of self-avoiding bridges of height $T$, taken at its critical point $1/μ$, tends to 0 as $T$ increases, as predicted from SLE theory.

math-ph↗

arXiv2013

A series test of the scaling limit of self-avoiding walks

It is widely believed that the scaling limit of self-avoiding walks (SAWs) at the critical temperature is (i) conformally invariant, and (ii) describable by Schramm-Loewner Evolution (SLE) with parameter $κ= 8/3.$ We consider SAWs in a rectangle, which originate at its centre and end when they reach the boundary. We assume that the scaling limit of SAWs is describable by ${\rm SLE}_κ,$ with the value of $κ$ to be determined. It has previously been shown by Guttmann and Kennedy \cite{GK13} that, in the scaling limit, the ratio of the probability that a SAW hits the side of the rectangle to the probability that it hits the end of the rectangle, depends on $κ.$ By considering rectangles of fixed aspect ratio 2, and also rectangles of aspect ratio 10, we calculate the probabilities exactly for larger and larger rectangles. By extrapolating this data to infinite rectangle size, we obtain the estimate $κ= 2.66664 \pm 0.00007$ for rectangles of aspect ratio 2 and $κ= 2.66675 \pm 0.00015$ for rectangles of aspect ratio 10. We also provide numerical evidence supporting the conjectured distribution of SAWs striking the boundary at various points in the case of rectangles with aspect ratio 2.

math-ph↗

arXiv2012

Self-avoiding walks and polygons -- an overview

This is a rather personal review of the problem of self-avoiding walks and polygons. After defining the problem, and outlining what is known rigorously and what is merely conjectured, I highlight the major outstanding problems. I then give several applications in which the I have been involved. These include a study of surface adsorption of polymers, counting possible paths in a telecommunication network, hitting probabilities of SAWs in a rectangle, and the modelling of biological experiments on polymers. I hope to show that SAWs are not only of intrinsic mathematical interest, but also have many interesting and useful applications.

math-ph↗

arXiv2012

Spanning tree generating functions and Mahler measures

We define the notion of a spanning tree generating function (STGF) $\sum a_n z^n$, which gives the spanning tree constant when evaluated at $z=1,$ and gives the lattice Green function (LGF) when differentiated. By making use of known results for logarithmic Mahler measures of certain Laurent polynomials, and proving new results, we express the STGFs as hypergeometric functions for all regular two and three dimensional lattices (and one higher-dimensional lattice). This gives closed form expressions for the spanning tree constants for all such lattices, which were previously largely unknown in all but one three-dimensional case. We show for all lattices that these can also be represented as Dirichlet $L$-series. Making the connection between spanning tree generating functions and lattice Green functions produces integral identities and hypergeometric connections, some of which appear to be new.

math-ph↗