Irving, J. and Rattan, Amarpreet (2009) The number of lattice paths below a cyclically shifting boundary. Journal of Combinatorial Theory, Series A 116 (3), pp. 499-514. ISSN 0097-3165.
Download (574kB) | Preview
We count the number of lattice paths lying under a cyclically shifting piecewise linear boundary of varying slope. Our main result can be viewed as an extension of well-known enumerative formulae concerning lattice paths dominated by lines of integer slope (e.g. the generalized ballot theorem). Its proof is bijective, involving a classical “reflection” argument. Moreover, a straightforward refinement of our bijection allows for the counting of paths with a specified number of corners. We also show how the result can be applied to give elegant derivations for the number of lattice walks under certain periodic boundaries. In particular, we recover known expressions concerning paths dominated by a line of half-integer slope, and some new and old formulae for paths lying under special “staircases.”
|Keyword(s) / Subject(s):||Lattice paths, ballot theorem, staircase boundaries, cycle lemma|
|School or Research Centre:||Birkbeck Schools and Research Centres > School of Business, Economics & Informatics > Economics, Mathematics and Statistics|
|Date Deposited:||01 Dec 2010 12:08|
|Last Modified:||22 Aug 2016 15:18|
Archive Staff Only (login required)