Computer Algebra for Lattice path Combinatorics Alin Bostan
To cite this version:
Alin Bostan. Computer Algebra for Lattice path Combinatorics. Symbolic Computation [cs.SC]. Université Paris 13, 2017. tel-01660300
HAL Id: tel-01660300 https://hal.archives-ouvertes.fr/tel-01660300 Submitted on 12 Dec 2017
HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. Université Paris 13 Laboratoire d’Informatique de Paris Nord
Habilitation à Diriger des Recherches
Spécialité : Sciences
Calcul Formel pour la Combinatoire des Marches
Soutenue le 15 décembre 2017 par
Alin Bostan (Inria)
devant le jury composé de :
Mme. Frédérique Bassino Université Paris 13, Villetaneuse M. Olivier Bodini Université Paris 13, Villetaneuse Mme. Mireille Bousquet-Mélou CNRS, Université de Bordeaux Mme. Lucia Di Vizio CNRS, Université de Versailles M. Mark Giesbrecht Université de Waterloo, Canada (rapporteur) M. Florent Hivert Université Paris 11, Orsay M. Christian Krattenthaler Université de Vienne, Autriche (rapporteur) M. Gilles Villard CNRS, ENS de Lyon (rapporteur) COMPUTER ALGEBRA FOR LATTICE PATH COMBINATORICS
ALIN BOSTAN∗
Abstract. Classifying lattice walks in restricted lattices is an important problem in enumerative combinatorics. Recently, computer algebra has been used to explore and to solve a number of diffi- cult questions related to lattice walks. We give an overview of recent results on structural properties and explicit formulas for generating functions of walks in the quarter plane, with an emphasis on the algorithmic methodology.
Key words. Enumerative combinatorics, random walks in cones, lattice paths in the quarter plane, Gessel walks, generating functions, computer algebra, automated guessing, creative telescoping, diago- nals, binomial sums, algebraic functions, D-finite functions, hypergeometric functions, elliptic integrals.
AMS subject classifications. Primary 05A10, 05A15, 05A16, 97N70, 33F10, 68W30, 14Q20; Secondary 33C05, 97N80, 13P15, 33C75, 12Y05, 13P05, 14Q20. This document is structured as follows. Section1 gives an overview of recent re- sults obtained in lattice path combinatorics with the help of computer algebra, with a focus on the exact enumeration of walks confined to the quarter plane. Sections2 and3 then go into more details of two classes of fruitful algorithmic approaches: guess-and-prove and creative telescoping. 1. General presentation. 1.1. Prelude. Consider the following innocent-looking problem. A tandem-walk is a path in Z2 taking steps from {↑, ←, &} only. Show that, for any integer n ≥ 0, the following quantities are equal:
(i) the number an of tandem-walks of length n (i.e., using n steps), confined to the upper half-plane Z × N, that start and end at (0, 0);
(ii) the number bn of tandem-walks of length n confined to the quar- ter plane N2, that start at (0, 0) and finish on the diagonal x = y.
For instance, for n = 3, this common value is a3 = b3 = 3, as shown below.
(i)
(ii)
The problem establishes a rather surprising connection between tandem-walks in the lattice plane, submitted to two different kinds of constraints: the evolution domain of the walk, and its ending point. The domain constraint is weaker for the first family of walks, while the ending constraint is relaxed for the second family. It appears that this problem is far from being trivial. Several solutions exist, but none of them is elementary. One of the main aims of the present text is to
∗Inria, Université Paris-Saclay, 91120 Palaiseau, France ([email protected]). 2 COMPUTER ALGEBRA FOR LATTICE PATH COMBINATORICS 3 convince the reader that this problem (and many others with a similar flavor) can be solved with the help of a computer. More precisely, Computer Algebra tools, extensively described in the following sections, can be used to discover and to prove the following equalities (3n)! (1) a = b = , and am = bm = 0 if 3 does not divide m. 3n 3n n!2 · (n + 1)! It goes without saying that such a simple and beautiful expression cannot be an element of chance. As it will turn out, closed forms are quite rare for this kind of enumeration problems. Nevertheless, even in absence of nice formulas, the struc- tural properties of the corresponding enumeration sequences reflect the symmetries of the step set and of the evolution domain. Equation (1) shows that the sequences (an) and (bn) are P-recursive, that is, they satisfy a linear recurrence with polyno- mial coefficients (in the index n). One of the messages that will emerge from the text is that this important property of the enumeration sequences is intimately related to the finiteness of a certain group, naturally attached to the step set {↑, ←, &}. 1.2. General context: lattice paths confined to cones. Let us put the previous problem into a more general framework. Let d ≥ 1 be an integer (dimension), let S d d be a finite subset (called step set, or model) of vectors in Z , and p0 ∈ Z (starting point). A S-path (or S-walk) of length n starting at p0 is a sequence (p0, p1,..., pn) d of elements in the lattice Z such that pi+1 − pi ∈ S for all 0 ≤ i < n. Let C be a cone of Rd, that is a subset of Rd such that r · v ∈ C for any v ∈ C and r > 0, assumed to contain p0. We will be interested in the (exact and asymptotic) enumeration of S-walks confined to the cone C, and potentially subject to additional constraints. Example 1. Consider the model S = {(1, 0), (−1, 0), (1, −1), (−1, 1)} (called the Gouyou-Beauchamps model) in dimension d = 2, with starting point p0 = (0, 0) and 2 with cone C = R+ (the quarter plane). The picture below displays the step set of the model (on the left), and a S-walk of length n = 17 confined to C (on the right).