Title of article
Simple formulas for lattice paths avoiding certain periodic staircase boundaries
Author/Authors
Chapman، نويسنده , , Robin J. and Chow، نويسنده , , Timothy Y. and Khetan، نويسنده , , Amit and Moulton، نويسنده , , David Petrie and Waters، نويسنده , , Robert J.، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2009
Pages
10
From page
205
To page
214
Abstract
There is a strikingly simple classical formula for the number of lattice paths avoiding the line x = k y when k is a positive integer. We show that the natural generalization of this simple formula continues to hold when the line x = k y is replaced by certain periodic staircase boundaries—but only under special conditions. The simple formula fails in general, and it remains an open question to what extent our results can be further generalized.
Keywords
Ballot sequence , Zigzag , Touching , Crossing , Stairstep , Tennis ball
Journal title
Journal of Combinatorial Theory Series A
Serial Year
2009
Journal title
Journal of Combinatorial Theory Series A
Record number
1531370
Link To Document