The bricklayer problem and the Strong Cycle Lemma
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.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.