Two combinatorial statistics on Dyck paths
Exact enumeration problems, generating functions (05A15) Partitions of sets (05A18) (q)-calculus and related topics (05A30) Orthogonal polynomials and functions of hypergeometric type (Jacobi, Laguerre, Hermite, Askey scheme, etc.) (33C45) Grammars and rewriting systems (68Q42) Combinatorics on words (68R15)
A Dyck path is a path in the first quadrant which begins at the origin, ends at \((2n,0)\), and consists of steps \((+1, +1)\) and \((+1,-1)\). The number of Dyck paths with length \(\ell\) is \(C_ \ell= (1/ (\ell+1)) \left( \begin{smallmatrix} 2\ell\\ \ell \end{smallmatrix} \right)\), the \(\ell\)th Catalan number. The authors investigate two related combinatorial statistics---the pyramid weight and the number of exterior pairs on the set of Dyck paths, and provide explicit formulae for the joint distributions of the path length and each of these two statistics. The proofs are combinatorial and rely on the method of \(q\)-grammars as well as on two new \(q\)-analogues of the Catalan numbers derived from statistics on non-crossing partitions. Connections with the combinatorics of Motzkin paths are pointed out.
- Statistics on Dyck paths
- Two statistics linking Dyck paths and non-crossing partitions
- Some statistics on Dyck paths
- Equivalence classes of Dyck paths modulo some statistics
- On Enumeration of Dyck--Schr\"oder Paths
- Moments of Dyck paths
- A refinement of Dyck paths: A combinatorial approach
- Exterior pairs and up step statistics on Dyck paths
- On the number of restricted Dyck paths
- \(q\)-enumeration of convex polyominoes
- A bijection from ordered trees to binary trees that sends the pruning order to the Strahler number
- Algebraic languages and polyominoes enumeration
- Attribute grammars are useful for combinatorics
- Combinatorial statistics on non-crossing partitions
- Enumeration of skew Ferrers diagrams and basic Bessel functions
- scientific article; zbMATH DE number 3928776 (Why is no real title available?)
- scientific article; zbMATH DE number 3976367 (Why is no real title available?)
- scientific article; zbMATH DE number 3489159 (Why is no real title available?)
- scientific article; zbMATH DE number 3499767 (Why is no real title available?)
- scientific article; zbMATH DE number 3443655 (Why is no real title available?)
- scientific article; zbMATH DE number 3405946 (Why is no real title available?)
- Multichains, non-crossing partitions and trees
- On context-free languages and push-down automata
- On the number of certain lattice polygons
- On the structure of the lattice of noncrossing partitions
- Planar Maps are Well Labeled Trees
- q-Catalan numbers
- Semantics of context-free languages
- Some \(q\)-analogues of the Schröder numbers arising from combinatorial statistics on lattice paths
- Sur les partitions non croisées d'un cycle. (The non-crossed partitions of a cycle)
- On pairs of non-crossing generalized Dyck paths
- Dyck path enumeration
- Constraint-sensitive Catalan path statistics having the Narayana distribution
- Some statistics on Dyck paths
- Bicoloured Dyck paths and the contact polynomial for \(n\) non-intersecting paths in a half-plane lattice
- Enumerating a class of lattice paths
- Dyck paths with a first return decomposition constrained by height
- A bijection between directed column-convex polyominoes and ordered trees of height at most three
- A second look at the toric \(h\)-polynomial of a cubical complex
- Weighted-inversion statistics and their symmetry groups
- Symmetric peaks and symmetric valleys in Dyck paths
- Some statistics on generalized Motzkin paths with vertical steps
- A new statistic on Dyck paths for counting 3-dimensional Catalan words
- Weighted Dyck paths with special restrictions on the levels of valleys
- Counting strings in Dyck paths
- A distributive lattice structure connecting Dyck paths, noncrossing partitions and 312-avoiding permutations
- All exponential moments of the Dyck paths' maxima (scaled by root of path length) are uniformly bounded: an elementary proof
- Dyck paths with parity restrictions for the final runs to the origin: a study of the height
- Random walks and hills
- New formulas for Dyck paths in a rectangle
- Counting Dyck paths by area and rank
- A simple and direct derivation for the number of noncrossing partitions
- scientific article; zbMATH DE number 1472132 (Why is no real title available?)
- Some enumerations on non-decreasing Dyck paths
- Enumerating restricted Dyck paths with context free grammars
- Enumerating symmetric peaks in non-decreasing Dyck paths
- A refinement of Dyck paths: A combinatorial approach
- Area of pyramidal Dyck paths
- Parametric production matrices and weighted succession rules: a Dyck path example
- Statistics on Dyck paths
- Two statistics linking Dyck paths and non-crossing partitions
- Exterior pairs and up step statistics on Dyck paths
- Dyck paths, Motzkin paths, and the binomial transform
- Dyck paths and partial Bell polynomials
- scientific article; zbMATH DE number 7662504 (Why is no real title available?)
- Protected Branches in Ordered Trees
- Down-step statistics in generalized Dyck paths
- \(2 \times 2\) minors of recursive matrices related to generalized Dyck paths
- Prefixes of Stanley's Catalan paths with odd returns to the x-axis-standard version and skew Catalan-Stanley paths.
- Fibonacci and Catalan paths in a wall
- Enumerating several statistics of r-colored Dyck paths with no dd-steps having the same colors
- Homological algebra of Nakayama algebras and 321-avoiding permutation
- Pattern distributions in Dyck paths with a first return decomposition constrained by height
- Counting upper interactions in Dyck paths
- Identities from weighted Motzkin paths
This page was built for publication: Two combinatorial statistics on Dyck paths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1343781)
