The bricklayer problem and the Strong Cycle Lemma
Combinatorics
2007-05-23 v1
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.
Keywords
Cite
@article{arxiv.math/9802026,
title = {The bricklayer problem and the Strong Cycle Lemma},
author = {Hunter S. Snevily and Douglas B. West},
journal= {arXiv preprint arXiv:math/9802026},
year = {2007}
}
Comments
14 pages, 8 included figures