The bricklayer problem and the Strong Cycle Lemma
arXiv:math/9802026
Abstract
We introduce a combinatorial enumeration problem that is solved using generalized Catalan numbers. We also study generalizations of the Cycle Lemma beyond the computation of the generalized Catalan numbers.
14 pages, 8 included figures