Walks on the Slit Plane: Other Approaches

AbstractLet S be a finite subset of Z2. A walk on the slit plane with steps in S is a sequence (0,0)=w0,w1,…,wn of points of Z2 such that wi+1−wi belongs to S for all i, and none of the points wi, i≥1, lie on the half-line H={(k,0):k≤0}. In a recent paper [Walks on the Slit Plane, preprint 2000, arXiv: match.CO/0012230] G. Schaeffer and the author computed the length generating function S(t) of walks on the slit plane for several sets S. All the generating functions thus obtained turned out to be algebraic: for instance, on the ordinary square lattice, St=1+1+4t1/21+1−4t1/2/21−4t3/4. The combinatorial reasons for this algebraicity remain obscure. In this paper, we present two new approaches for solving slit plane models. One of them simplifies and extends the functional equation approach of the original paper. The other one is inspired by an argument of Lawler; it is more combinatorial, and explains the algebraicity of the product of three series related to the model. It can also be seen as an extension of the classical cycle lemma. Both methods work for any set of steps S. We exhibit a large family of sets S for which the generating function of walks on the slit plane is algebraic, and another family for which it is neither algebraic, nor even D-finite. These examples give a hint at where the border between algebraicity and transcendence lies, and call for a complete classification of the sets S