Abstract
We give new interpretations of Catalan and convoluted Catalan numbers in terms of trees and chain blockers. For a poset P we say that a subset A ⊆ P is a chain blocker if it is an inclusionwise minimal subset of P that contains at least one element from every maximal chain. In particular, we study the set of chain blockers for the class of posets P = C a × C b where C i is the chain 1 < ⋯ < i. We show that subclasses of these chain blockers are counted by Catalan and convoluted Catalan numbers.
Similar content being viewed by others
References
Catalan, E.: Sur les nombres de Segner. Rend. Circ. Mat. Palermo 1, 190–201 (1887)
Foldes, S., Woodroofe, R.: Antichain cutsets of strongly connected posets. Order 30, 351–361 (2013)
Regev, A.: A proof of Catalan’s convolution formula. Integers 12, #A29 (2012)
Rival, I., Zaguia, N.: Antichain cutsets. Order 1, 235247 (1985)
Stanley, R.P.: Catalan Numbers. Cambridge University Press, Cambridge (2015)
Tedfordm, S.J.: Combinatorial interpretations of convolutions of the Catalan numbers. Integers 11, #A3 (2011)
West, J.: Generating trees and the Catalan and Schröder numbers. Discret. Math. 146, 247–262 (1995)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Ahmad, S., Welker, V. Chain Blockers and Convoluted Catalan Numbers. Order 33, 347–358 (2016). https://doi.org/10.1007/s11083-015-9370-z
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11083-015-9370-z