Two combinatorial statistics on Dyck paths

DOI10.1016/0012-365X(93)E0147-VzbMath0815.05003OpenAlexW2072157778MaRDI QIDQ1343781

Rodica Simion, Alain Denise

Publication date: 11 June 1995

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(93)e0147-v

zbMATH Keywords

partitionsCatalan numberDyck pathcombinatorial statistics\(q\)- analogues\(q\)-grammars

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Partitions of sets (05A18) (q)-calculus and related topics (05A30) Combinatorics on words (68R15) Orthogonal polynomials and functions of hypergeometric type (Jacobi, Laguerre, Hermite, Askey scheme, etc.) (33C45) Grammars and rewriting systems (68Q42)

Related Items

Protected Branches in Ordered Trees, A bijection between directed column-convex polyominoes and ordered trees of height at most three, A refinement of Dyck paths: A combinatorial approach, A second look at the toric \(h\)-polynomial of a cubical complex, Enumerating a class of lattice paths, Weighted-inversion statistics and their symmetry groups, Some enumerations on non-decreasing Dyck paths, Counting strings in Dyck paths, Dyck paths with a first return decomposition constrained by height, Identities from weighted Motzkin paths, A simple and direct derivation for the number of noncrossing partitions, A distributive lattice structure connecting Dyck paths, noncrossing partitions and 312-avoiding permutations, Symmetric peaks and symmetric valleys in Dyck paths, Pattern distributions in Dyck paths with a first return decomposition constrained by height, Enumerating symmetric peaks in non-decreasing Dyck paths, Some statistics on generalized Motzkin paths with vertical steps

Cites Work

• A bijection from ordered trees to binary trees that sends the pruning order to the Strahler number
• q-Catalan numbers
• Multichains, non-crossing partitions and trees
• On the structure of the lattice of noncrossing partitions
• Attribute grammars are useful for combinatorics
• Some \(q\)-analogues of the Schröder numbers arising from combinatorial statistics on lattice paths
• Enumeration of skew Ferrers diagrams and basic Bessel functions
• \(q\)-enumeration of convex polyominoes
• Combinatorial statistics on non-crossing partitions
• Algebraic languages and polyominoes enumeration
• Sur les partitions non croisées d'un cycle. (The non-crossed partitions of a cycle)
• Planar Maps are Well Labeled Trees
• On the number of certain lattice polygons
• Semantics of context-free languages
• On context-free languages and push-down automata
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item