A walk in my lattice path garden

Abstract

Various lattice path models are reviewed. The enumeration is done using generating functions. A few bijective considerations are woven in as well. The kernel method is often used. Computer algebra was an essential tool. Some results are new, some have appeared before.The lattice path models we treated, are: Hoppy's walks, the combinatorics of sequence A002212 in [47] (skew Dyck paths, Schröder paths, Hex-trees, decorated ordered trees, multi-edge trees, etc.) Weighted unary-binary trees also occur, and we could improve on our old paper on Horton-Strahler numbers [17], by using a different substitution. Some material on ternary trees appears as well, as on Motzkin numbers and paths (a model due to Retakh), and a new concept called amplitude that was found in [6]. Some new results on Deutsch paths in a strip are included as well. During the Covid period, I spent much time with this beautiful concept that I dare to call Deutsch paths, since Emeric Deutsch stands at the beginning with a problem that he posted in the American Mathematical Monthly some 20 years ago. Peaks and valleys, studied by Rainer Kemp 40 years under the names max-turns and min-turns, are revisited with a more modern approach, streamlining the analysis, relying on the 'subcritical case' (named so by Philippe Flajolet), the adding a new slice technique and once again the kernel method.