Counting quadrant walks via Tutte's invariant method (extended abstract)

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Bernardi, O, Bousquet-Mélou, M, Raschel, Kilian
Format: Preprint
Published: 2015
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866910907592867840
author Bernardi, O
Bousquet-Mélou, M
Raschel, Kilian
author_facet Bernardi, O
Bousquet-Mélou, M
Raschel, Kilian
contents In the 1970s, Tutte developed a clever algebraic approach, based on certain "invariants" , to solve a functional equation that arises in the enumeration of properly colored triangulations. The enumeration of plane lattice walks confined to the first quadrant is governed by similar equations, and has led in the past decade to a rich collection of attractive results dealing with the nature (algebraic, D-finite or not) of the associated generating function, depending on the set of allowed steps. We first adapt Tutte's approach to prove (or reprove) the algebraicity of all quadrant models known or conjectured to be algebraic (with one small exception). This includes Gessel's famous model, and the first proof ever found for one model with weighted steps. To be applicable, the method requires the existence of two rational functions called invariant and decoupling function respectively. When they exist, algebraicity comes out (almost) automatically. Then, we move to an analytic viewpoint which has already proved very powerful, leading in particular to integral expressions of the generating function in the non-D-finite cases, as well as to proofs of non-D-finiteness. We develop in this context a weaker notion of invariant. Now all quadrant models have invariants, and for those that have in addition a decoupling function, we obtain integral-free expressions of the generating function, and a proof that this series is differentially algebraic (that is, satisfies a non-linear differential equation).
format Preprint
id arxiv_https___arxiv_org_abs_1511_04298
institution arXiv
publishDate 2015
record_format arxiv
spellingShingle Counting quadrant walks via Tutte's invariant method (extended abstract)
Bernardi, O
Bousquet-Mélou, M
Raschel, Kilian
Combinatorics
Probability
In the 1970s, Tutte developed a clever algebraic approach, based on certain "invariants" , to solve a functional equation that arises in the enumeration of properly colored triangulations. The enumeration of plane lattice walks confined to the first quadrant is governed by similar equations, and has led in the past decade to a rich collection of attractive results dealing with the nature (algebraic, D-finite or not) of the associated generating function, depending on the set of allowed steps. We first adapt Tutte's approach to prove (or reprove) the algebraicity of all quadrant models known or conjectured to be algebraic (with one small exception). This includes Gessel's famous model, and the first proof ever found for one model with weighted steps. To be applicable, the method requires the existence of two rational functions called invariant and decoupling function respectively. When they exist, algebraicity comes out (almost) automatically. Then, we move to an analytic viewpoint which has already proved very powerful, leading in particular to integral expressions of the generating function in the non-D-finite cases, as well as to proofs of non-D-finiteness. We develop in this context a weaker notion of invariant. Now all quadrant models have invariants, and for those that have in addition a decoupling function, we obtain integral-free expressions of the generating function, and a proof that this series is differentially algebraic (that is, satisfies a non-linear differential equation).
title Counting quadrant walks via Tutte's invariant method (extended abstract)
topic Combinatorics
Probability
url https://arxiv.org/abs/1511.04298