Enumerative Results on the Schröder Pattern Poset
The set of Schröder words (Schröder language) is endowed with a natural partial order, which can be conveniently described by interpreting Schröder words as lattice paths. The resulting poset is called the Schröder pattern poset. We find closed formulas for the number of Schröder words covering/covered by a given Schröder word in terms of classical parameters of the associated Schröder path. We also enumerate several classes of Schröder avoiding words (with respect to the length), i.e. sets of Schröder words which do not contain a given Schröder word.
KeywordsWord Length Covering Relation Fibonacci Number Lattice Path Binomial Coefficient
- 2.Bernini, A., Ferrari, L., Pinzani, R., West, J.: Pattern avoiding Dyck paths. Discrete Math. Theoret. Comput. Sci. Proc. AS, 683–694 (2013)Google Scholar
- 7.N. J. A. Sloane, The On-Line Encyclopedia of Integer Sequences, electronically available at oeis.org
- 8.Spielman, D.A., Bóna, M.: An infinite antichain of permutations. Electron. J. Combin. 7, 4 (2000). #N2Google Scholar