The Bricklayer Problem and the Strong Cycle Lemma

DOI10.2307/2589644MaRDI QIDQ4221592zbMATH OpenOpenAlexWikidataFDO

Authors Hunter Snevily, Douglas B. West

Publication date 9 September 1999

Full work available at URL https://arxiv.org/abs/math/9802026

zbMATH Keywords

\(q\)-stackballot problembrickbricklayer problemcombinatorial enumerationcounting problems

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Other designs, configurations (05B30)

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.

Recommendations

• The LEGO counting problem
• Automated counting of lego towers
• Restricted Lego towers
• Broken bricks and the pick-up sticks problem

Cited in

(7)

• A bijective proof of an enumerative property of legal bracketings
• The Bohnenblust-Spitzer algorithm and its applications
• The LEGO counting problem
• Restricted Lego towers
• ANISOTROPIC STEP, SURFACE CONTACT, AND AREA WEIGHTED DIRECTED WALKS ON THE TRIANGULAR LATTICE
• On 1-factorizations of bipartite Kneser graphs
• Raney and Catalan

This page was built for publication: The Bricklayer Problem and the Strong Cycle Lemma

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4221592)