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.
Type de document :
Communication dans un congrès
Alberto Dennunzio; Enrico Formenti; Luca Manzoni; Antonio E. Porreca. 23th International Workshop on Cellular Automata and Discrete Complex Systems (AUTOMATA), Jun 2017, Milan, Italy. Springer International Publishing, Lecture Notes in Computer Science, LNCS-10248, pp.56-67, 2017, Cellular Automata and Discrete Complex Systems. 〈10.1007/978-3-319-58631-1_5〉
https://hal.inria.fr/hal-01656348
Contributeur : Hal Ifip
<>
Soumis le : mardi 5 décembre 2017 - 15:41:55
Dernière modification le : mardi 5 décembre 2017 - 15:55:56
Lapo Cioni, Luca Ferrari. Enumerative Results on the Schröder Pattern Poset. Alberto Dennunzio; Enrico Formenti; Luca Manzoni; Antonio E. Porreca. 23th International Workshop on Cellular Automata and Discrete Complex Systems (AUTOMATA), Jun 2017, Milan, Italy. Springer International Publishing, Lecture Notes in Computer Science, LNCS-10248, pp.56-67, 2017, Cellular Automata and Discrete Complex Systems. 〈10.1007/978-3-319-58631-1_5〉. 〈hal-01656348〉
