Andrew Elvey Price

• CNRS researcher at University of Tours

Pattern-avoiding ascent sequences have recently been related to set-partition problems and stack-sorting problems. While the generating functions for several length-3 pattern-avoiding ascent sequences are known, those avoiding 000, 100, 110, 120 are not known. We have generated extensive series expansions for these four cases, and analysed them in...

We address the enumeration of walks with small steps confined to a two-dimensional cone, for example the quarter plane, three-quarter plane or the slit plane. In the quarter plane case, the solutions for unweighted step-sets are already well understood, in the sense that it is known precisely for which cases the generating function is algebraic, D-...

Pattern-avoiding ascent sequences have recently been related to set-partition problems and stack-sorting problems. While the generating functions for several length-3 pattern-avoiding ascent sequences are known, those avoiding 000, 100, 110, 120 are not known. We have generated extensive series expansions for these four cases, and analysed them in...

We give an example of a Cayley graph [Formula: see text] for the group [Formula: see text] which is not minimally almost convex (MAC). On the other hand, the standard Cayley graph for [Formula: see text] does satisfy the falsification by fellow traveler property (FFTP), which is strictly stronger. As a result, any Cayley graph property [Formula: se...

We derive a simple functional equation with two catalytic variables characterising the generating function of 3-stack-sortable permutations. Using this functional equation, we extend the 174-term series to 1000 terms. From this series, we conjecture that the generating function behaves as $$W(t) \sim C_0(1-\mu_3 t)^\alpha \cdot \log^\beta(1-\mu_3 t...

This paper solves an open question of Mortimer and Prellberg asking for an explicit bijection between two families of walks. The first family is formed by what we name triangular walks, which are two-dimensional walks moving in six directions (0°, 60°, 120°, 180°, 240°, 300°) and confined within a triangle. The other family is comprised of two-colo...

We consider a semimartingale reflected Brownian motion (SRBM) in a two-dimensional wedge. Under standard assumptions on the parameters of the model (opening of the wedge, angles of the reflections on the axes, drift), we study the algebraic and differential nature of the Laplace transform of its stationary distribution. We derive necessary and suff...

A compacted binary tree is a directed acyclic graph encoding a binary tree in which common subtrees are factored and shared, such that they are represented only once. We show that the number of compacted binary trees of size n grows asymptotically likeΘ(n!4ne3a1n1/3n3/4), where a1≈−2.338 is the largest root of the Airy function. Our method involves...

A small set of combinatorial sequences have coefficients that can be represented as moments of a nonnegative measure on $[0, \infty)$. Such sequences are known as Stieltjes moment sequences. They have a number of nice properties, such as log-convexity, which are useful to rigorously bound their growth constant from below. This article focuses on so...

We find a Thron-type continued fraction (T-fraction) for the ordinary generating function of the Ward polynomials, as well as for some generalizations employing a large (indeed infinite) family of independent indeterminates. Our proof is based on a bijection between super-augmented perfect matchings and labeled Schröder paths, which generalizes Fla...

We derive a simple functional equation with two catalytic variables characterising the generating function of 3-stack-sortable permutations. Using this functional equation, we extend the 174-term series to 1000 terms. From this series, we conjecture that the generating function behaves as $$W(t) \sim C_0(1-\mu_3 t)^\alpha \cdot \log^\beta(1-\mu_3 t...

This paper solves an open question of Mortimer and Prellberg asking for an explicit bijection between two families of walks. The first family is formed by what we name triangular walks, which are two-dimensional walks moving in six directions (0{\deg}, 60{\deg}, 120{\deg}, 180{\deg}, 240{\deg}, 300{\deg}) and confined within a triangle. The other f...

We address the six vertex model on a random lattice, which in combinatorial terms corresponds to the enumeration of weighted 4-valent planar maps equipped with an Eulerian orientation. This problem was exactly, albeit non-rigorously solved by Ivan Kostov in 2000 using matrix integral techniques. We convert Kostov's work to a combinatorial argument...

We address the problem of counting walks by winding angle on the Kreweras lattice, an oriented version of the triangular lattice. Our method uses a new decomposition of the lattice, which allows us to write functional equations characterising a generating function of walks counted by length, endpoint and winding angle. We then solve these functiona...

We establish an improved lower bound of 10.271 for the exponential growth rate of the class of permutations avoiding the pattern 1324, and an improved upper bound of 13.5. These results depend on a new exact structural characterisation of 1324-avoiders as a subclass of an infinite staircase grid class, together with precise asymptotics of a small d...

We find a Thron-type continued fraction (T-fraction) for the ordinary generating function of the Ward polynomials, as well as for some generalizations employing a large (indeed infinite) family of independent indeterminates. Our proof is based on a bijection between super-augmented perfect matchings and labeled Schr\"oder paths, which generalizes F...

A small subset of combinatorial sequences have coefficients that can be represented as moments of a nonnegative measure on $[0, \infty)$. Such sequences are known as Stieltjes moment sequences. This article focuses on some classical sequences in enumerative combinatorics, denoted $Av(\mathcal{P})$, and counting permutations of $\{1, 2, \ldots, n \}...

Recently Albert and Bousquet-M\'elou obtained the solution to the long-standing problem of the enumeration of permutations sortable by two stacks in parallel (2sip). Their solution was expressed in terms of functional equations. E.P. and Guttmann then showed that the equally long-standing problem of the number of permutations sortable by a double e...

A compacted binary tree is a directed acyclic graph encoding a binary tree in which common subtrees are factored and shared, such that they are represented only once. We show that the number of compacted binary trees of size $n$ is asymptotically given by $$ \Theta\left( n! \, 4^n e^{3a_1n^{1/3}} n^{3/4} \right), $$ where $a_1\approx-2.338$ is the...

We address the enumeration of planar 4-valent maps equipped with an Eulerian orientation by two different methods, and compare the solutions we thus obtain. With the first method we enumerate these orientations as well as a restricted class which we show to be in bijection with general Eulerian orientations. The second method, based on the work of...

The enumeration of planar maps equipped with an Eulerian orientation has attracted attention in both combinatorics and theoretical physics since at least 2000. The case of 4-valent maps is particularly interesting: these orientations are in bijection with properly 3-coloured quadrangulations, while in physics they correspond to configurations of th...

The enumeration of planar maps equipped with an Eulerian orientation has attracted attention in both combinatorics and theoretical physics since at least 2000. The case of 4-valent maps is particularly interesting: these orientations are in bijection with properly 3-coloured quadrangulations, while in physics they correspond to configurations of th...

We establish an improved lower bound of 10.271 for the exponential growth rate of the class of permutations avoiding the pattern 1324, and an improved upper bound of 13.5. These results depend on a new exact structural characterisation of 1324-avoiders as a subclass of an infinite staircase grid class, together with precise asymptotics of a small "...

We establish a lower bound of 10.271 for the growth rate of the permutations avoiding 1324, and an upper bound of 13.5. This is done by first finding the precise growth rate of a subclass whose enumeration is related to West-2-stack-sortable permutations, and then combining copies of this subclass in particular ways.

Inspired by the paper of Bonichon, Bousquet-M\'elou, Dorbec and Pennarun, we give a system of functional equations which characterise the ordinary generating function, $U(x),$ for the number of planar Eulerian orientations counted by edges. We also characterise the ogf $A(x)$, for 4-valent planar Eulerian orientations counted by vertices in a simil...

Inspired by the paper of Bonichon, Bousquet-M\'elou, Dorbec and Pennarun, we give a system of functional equations which characterise the ordinary generating function, $U(x),$ for the number of planar Eulerian orientations counted by edges. We also characterise the ogf $A(x)$, for 4-valent planar Eulerian orientations counted by vertices in a simil...

We have developed polynomial-time algorithms to generate terms of the cogrowth series for groups [Formula: see text], the lamplighter group, [Formula: see text] and the Brin–Navas group [Formula: see text]. We have also given an improved algorithm for the coefficients of Thompson’s group [Formula: see text], giving 32 terms of the cogrowth series....

We have developed polynomial-time algorithms to generate terms of the cogrowth series for groups $\mathbb{Z}\wr \mathbb{Z},$ the lamplighter group, $(\mathbb{Z}\wr \mathbb{Z})\wr \mathbb{Z}$ and the Navas-Brin group $B.$ We have also given an improved algorithm for the coefficients of Thompson's group $F,$ giving 32 terms of the cogrowth series. We...

Let $\Gamma_{n,q}$ be the point-hyperplane incidence graph of the projective space $\operatorname{PG}(n,q)$, where $n \ge 2$ is an integer and $q$ a prime power. We determine the order of magnitude of $1-i_V(\Gamma_{n,q})$, where $i_V(\Gamma_{n,q})$ is the vertex-isoperimetric number of $\Gamma_{n,q}$. We also obtain the exact values of $i_V(\Gamma...

We give an example of a Cayley graph $\Gamma$ for the group $F_{2}\times F_{2}$ which is not minimally almost convex (MAC). On the other hand, the standard Cayley graph for $F_{2}\times F_{2}$ does satisfy the falsification by fellow traveler property (FFTP). As a result, we show that any Cayley graph property $K$ which satisfies $\text{FFTP}\Right...

We have studied the problem of the number of permutations that can be sorted by two stacks in series. We do this by first counting all such permutations of length less than 20 exactly, then using a numerical technique to obtain eleven further coefficients approximately. Analysing these coefficients by a variety of methods we conclude that the OGF b...

We address the problem of the number of permutations that can be sorted by two stacks in series. We do this by first counting all such permutations of length less than 20 exactly, then using a numerical technique to obtain nineteen further coefficients approximately. Analysing these coefficients by a variety of methods we conclude that the OGF beha...

Recently Albert and Bousquet-M\'elou \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 deque can be simply rel...

Using an off-critical deformation of the identity of Duminil-Copin and Smirnov, we prove a relationship between half-plane surface critical exponents $\gamma_1$ and $\gamma_{11}$ as well as wedge critical exponents $\gamma_2(\alpha)$ and $\gamma_{21}(\alpha)$ and the exponent characterising the winding angle distribution of the O($n$) model in the...