Enumerative combinatorics of intervals in the Dyck pattern poset
From MaRDI portal
Publication:2665832
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"obius function of the Dyck pattern poset, giving for instance a closed expression for the M"obius function of initial intervals whose maximum is a Dyck path having exactly two peaks.
Recommendations
Cites work
- scientific article; zbMATH DE number 2024859 (Why is no real title available?)
- Intervals and factors in the Bruhat order
- On intervals of the consecutive pattern poset
- Pattern-avoiding Dyck paths
- Planar triangulations, bridgeless planar maps and Tamari intervals
- The Dyck pattern poset
- Two bijections on Tamari intervals
Cited in
(9)- Enumeration of some classes of pattern avoiding matchings, with a glimpse into the matching pattern poset
- Patterns in Shi tableaux and Dyck paths
- A sequence representation of the Dyck path poset.
- The Dyck pattern poset
- Combinatorial patterns for maps of the interval
- Dyck paths and positroids from unit interval orders
- Restricting Dyck paths and 312-avoiding permutations
- Interview with Einar Steingrímsson
- Between weak and Bruhat: the middle order on permutations
This page was built for publication: Enumerative combinatorics of intervals in the Dyck pattern poset
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2665832)