| HAL-Inria | Publications, software ... of Inria's scientists |
Conference papers
Enumerative Results on the Schröder Pattern Poset
Abstract : 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.
Cited literature [8 references]
https://hal.inria.fr/hal-01656348
Contributor : Hal Ifip Connect in order to contact the contributor
Submitted on : Tuesday, December 5, 2017 - 3:41:55 PM
Last modification on : Tuesday, December 7, 2021 - 4:26:03 PM
Contributor : Hal Ifip Connect in order to contact the contributor
Submitted on : Tuesday, December 5, 2017 - 3:41:55 PM
Last modification on : Tuesday, December 7, 2021 - 4:26:03 PM
File
447449_1_En_5_Chapter.pdf
Files produced by the author(s)
Licence
Distributed under a Creative Commons Attribution 4.0 International License