On the functions counting walks with small steps in the quarter plane

Models of spatially homogeneous walks in the quarter plane $\mathbf{ Z}_{+}^{2}$ with steps taken from a subset $\mathcal{S}$ of the set of jumps to the eight nearest neighbors are considered. The generating function (x,y,z)↦Q(x,y;z) of the numbers q(i,j;n) of such walks starting at the origin and ending at $(i,j) \in\mathbf{ Z}_{+}^{2}$ after n steps is studied. For all non-singular models of walks, the functions x↦Q(x,0;z) and y↦Q(0,y;z) are continued as multi-valued functions on C having infinitely many meromorphic branches, of which the set of poles is identified. The nature of these functions is derived from this result: namely, for all the 51 walks which admit a certain infinite group of birational transformations of C2, the interval $]0,1/|\mathcal{S}|[$ of variation of z splits into two dense subsets such that the functions x↦Q(x,0;z) and y↦Q(0,y;z) are shown to be holonomic for any z from the one of them and non-holonomic for any z from the other. This entails the non-holonomy of (x,y,z)↦Q(x,y;z), and therefore proves a conjecture of Bousquet-Mélou and Mishna in Contemp. Math. 520:1–40 (2010).

[1]  V. A. Malyshev An analytical method in the theory of two-dimensional positive random walks , 1972 .

[2]  Marni Mishna,et al.  Two non-holonomic lattice walks in the quarter plane , 2009, Theor. Comput. Sci..

[3]  G. Fayolle,et al.  Two coupled processors: The reduction to a Riemann-Hilbert problem , 1979 .

[4]  Guy Fayolle,et al.  On the Holonomy or Algebraicity of Generating Functions Counting Lattice Walks in the Quarter-Plane , 2010, 1004.1733.

[5]  Guy Fayolle,et al.  Random walks in the quarter plane with zero drift: an explicit criterion for the finiteness of the associated group , 2011 .

[6]  Mireille Bousquet-M'elou,et al.  Walks in the quarter plane: Kreweras’ algebraic model , 2004, math/0401067.

[7]  Charalambos A. Charalambides,et al.  Enumerative combinatorics , 2018, SIGA.

[8]  Manuel Kauers,et al.  The complete Generating Function for Gessel Walks is Algebraic , 2009, ArXiv.

[9]  Ira M. Gessel A probabilistic method for lattice path enumeration , 1986 .

[10]  Stephen Melczer,et al.  Singularity Analysis Via the Iterated Kernel Method , 2014, Comb. Probab. Comput..

[11]  J. C. Burkill,et al.  Complex Functions , 1968, Nature.

[12]  Mireille Bousquet-Mélou,et al.  Walks confined in a quadrant are not always D-finite , 2003, Theor. Comput. Sci..

[13]  Giovanni Sansone,et al.  Lectures on the theory of functions of a complex variable , 1961 .

[14]  Edmund Taylor Whittaker,et al.  A Course of Modern Analysis , 2021 .

[15]  Doron Zeilberger,et al.  Proof of Ira Gessel's lattice path conjecture , 2008, Proceedings of the National Academy of Sciences.

[16]  Kilian Raschel,et al.  Explicit expression for the generating function counting Gessel's walks , 2009, Adv. Appl. Math..

[17]  Philippe Flajolet,et al.  Analytic Combinatorics , 2009 .

[18]  R. Stanley,et al.  Enumerative Combinatorics: Index , 1999 .

[19]  Marni Mishna,et al.  Walks with small steps in the quarter plane , 2008, 0810.4387.

[20]  P. Flajolet,et al.  Analytic Combinatorics: RANDOM STRUCTURES , 2009 .

[21]  Manuel Kauers,et al.  Automatic Classification of Restricted Lattice Walks , 2008, 0811.2899.

[22]  Kilian Raschel Counting walks in a quadrant: a unified approach via boundary value problems , 2010 .