Pattern distributions in Dyck paths with a first return decomposition constrained by height
نویسندگان
چکیده
منابع مشابه
Pattern - avoiding Dyck paths †
We introduce the notion of pattern in the context of lattice paths, and investigate it in the specific case of Dyck paths. Similarly to the case of permutations, the pattern-containment relation defines a poset structure on the set of all Dyck paths, which we call the Dyck pattern poset. Given a Dyck path P , we determine a formula for the number of Dyck paths covered by P , as well as for the ...
متن کاملEnumeration of area-weighted Dyck paths with restricted height
Dyck paths are directed walks on Z starting at (0, 0) and ending on the line y = 0, which have no vertices with negative y-coordinates, and which have steps in the (1, 1) and (1,−1) directions [11]. We impose the additional geometrical constraint that the paths have height at most h, that is, they lie between lines y = 0 and y = h. Given a Dyck path π, we define the length n(π) to be half the n...
متن کاملDyck paths with coloured ascents
We introduce a notion of Dyck paths with coloured ascents. For several ways of colouring, we establish bijections between sets of such paths and other combinatorial structures, such as non-crossing trees, dissections of a convex polygon, etc. In some cases enumeration gives new expression for sequences enumerating these structures.
متن کاملOn Generalized Dyck Paths
We generalize the elegant bijective proof of the Chung Feller theorem from the paper of Young-Ming Chen [The Chung-Feller theorem revisited, Disc. Math. 308 (2008), 1328–1329].
متن کاملRepresentation of Numerical Semigroups by Dyck Paths
We introduce square diagrams that represent numerical semigroups and we obtain an injection from the set of numerical semigroups into the set of Dyck paths.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2020
ISSN: 0012-365X
DOI: 10.1016/j.disc.2020.111995