activity
20192021
most citedCounting lattice walks by winding angle

9 citations · 14 across the 5 of their papers we have counts for

collaborators

9 papers

math.CO2021

Pattern-avoiding ascent sequences of length 3

Andrew R Conway, Miles Conway, Andrew Elvey Price +1

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-avoid…

math.CO2020

Asymptotics of 3-stack-sortable permutations

Colin Defant, Andrew Elvey Price, Anthony J Guttmann

We derive a simple functional equation with two catalytic variables characterising the generating function of 3-stack-sortable permutations. Using this functional equation, we exte…

math.CO2020

Bijections between walks inside a triangular domain and Motzkin paths of bounded amplitude

Julien Courtiel, Andrew Elvey Price, Irène Marcovici

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 w…

math.CO20201 cited

The six-vertex model on random planar maps revisited

Andrew Elvey Price, Paul Zinn-Justin

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 orientat…

math.CO20209 cited

Counting lattice walks by winding angle

Andrew Elvey Price

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…

math.CO2020

Phylogenetic trees, augmented perfect matchings, and a Thron-type continued fraction (T-fraction) for the Ward polynomials

Andrew Elvey Price, Alan D. Sokal

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 inf…