We interpret Dyck paths of height at most h and without valleys at height h − 1 combinatorially, by means of 312-avoiding permutations with some restrictions on their left-to-right maxima. We obtain our results by analyzing a restriction of a well-known bijection between the sets of Dyck paths and 312-avoiding permutations. We also provide a recursive formula enumerating these two structures by using the ECO method and the theory of production matrices. As a further result we obtain a family of combinatorial identities involving Catalan numbers.
Restricting Dyck Paths and 312-Avoiding Permutations / Elena Barcucci, Antonio Bernini, Stefano Bilotta, Renzo Pinzani. - In: JOURNAL OF INTEGER SEQUENCES. - ISSN 1530-7638. - ELETTRONICO. - 26:(2023), pp. 23.8.5.0-23.8.5.0.
Restricting Dyck Paths and 312-Avoiding Permutations
Elena Barcucci;Antonio Bernini
;Stefano Bilotta;Renzo Pinzani
2023
Abstract
We interpret Dyck paths of height at most h and without valleys at height h − 1 combinatorially, by means of 312-avoiding permutations with some restrictions on their left-to-right maxima. We obtain our results by analyzing a restriction of a well-known bijection between the sets of Dyck paths and 312-avoiding permutations. We also provide a recursive formula enumerating these two structures by using the ECO method and the theory of production matrices. As a further result we obtain a family of combinatorial identities involving Catalan numbers.File | Dimensione | Formato | |
---|---|---|---|
bernini13_.pdf
accesso aperto
Tipologia:
Pdf editoriale (Version of record)
Licenza:
Open Access
Dimensione
397.27 kB
Formato
Adobe PDF
|
397.27 kB | Adobe PDF |
I documenti in FLORE sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.