The bricklayer problem and the Strong Cycle Lemma

Simple item page
dc.creatorSnevily, Hunter S.
dc.creatorWest, Douglas B.
dc.date1998-02-05
dc.date.accessioned2026-07-07T05:23:47Z
dc.date.available2026-07-07T05:23:47Z
dc.descriptionWe 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.
dc.description14 pages, 8 included figures
dc.identifierhttps://arxiv.org/abs/math/9802026
dc.identifierhttp://arxiv.org/abs/math/9802026
dc.identifierAmer. Math. Monthly, 105 (1998), 131-143
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/76576
dc.subjectCombinatorics
dc.subject05A15, 05A10
dc.titleThe bricklayer problem and the Strong Cycle Lemma
dc.typetext

Files

Collections

arXiv