English

Non-D-finite excursions in the quarter plane

Combinatorics 2013-12-10 v3 Probability

Abstract

The number of excursions (finite paths starting and ending at the origin) having a given number of steps and obeying various geometric constraints is a classical topic of combinatorics and probability theory. We prove that the sequence (enS)n0(e^{\mathfrak{S}}_n)_{n\geq 0} of numbers of excursions in the quarter plane corresponding to a nonsingular step set S{0,±1}2\mathfrak{S} \subseteq \{0,\pm 1 \}^2 with infinite group does not satisfy any nontrivial linear recurrence with polynomial coefficients. Accordingly, in those cases, the trivariate generating function of the numbers of walks with given length and prescribed ending point is not D-finite. Moreover, we display the asymptotics of enSe^{\mathfrak{S}}_n.

Keywords

Cite

@article{arxiv.1205.3300,
  title  = {Non-D-finite excursions in the quarter plane},
  author = {Alin Bostan and Kilian Raschel and Bruno Salvy},
  journal= {arXiv preprint arXiv:1205.3300},
  year   = {2013}
}

Comments

17 pages, 2 figures and 2 tables