Enumerative combinatorics of intervals in the Dyck pattern poset

Tools

Bernini, Antonio and Cervetti, Matteo and Ferrari, Luca and Steingrímsson, Einar (2021) Enumerative combinatorics of intervals in the Dyck pattern poset. Order, 38 (3). pp. 473-487. ISSN 0167-8094 (https://doi.org/10.1007/s11083-021-09552-9)

[thumbnail of Bernini-etal-Order-2021-Enumerative-combinatorics-of-intervals-in-the-Dyck-pattern-poset]
Preview
 Text. Filename: Bernini_etal_Order_2021_Enumerative_combinatorics_of_intervals_in_the_Dyck_pattern_poset.pdf
Final Published Version
License: Creative Commons Attribution 4.0 logo
Download (449kB)| Preview

Abstract

We initiate the study of the enumerative combinatorics of the intervals in the Dyck pattern poset. More specifically, we find some closed formulas to express the size of some specific intervals, as well as the number of their covering relations. In most of the cases, we are also able to refine our formulas by rank. We also provide the first results on the Möbius function of the Dyck pattern poset, giving for instance a closed expression for the Möbius function of initial intervals whose maximum is a Dyck path having exactly two peaks.

ORCID iDs

Bernini, Antonio, Cervetti, Matteo, Ferrari, Luca and Steingrímsson, Einar ORCID logoORCID: https://orcid.org/0000-0003-4611-0849;
CORE (COnnecting REpositories)