Enumerating symmetric peaks in non-decreasing Dyck paths
From MaRDI portal
Publication:5013351
DOI10.26493/1855-3974.2478.d1bzbMath1479.05015OpenAlexW3155594216MaRDI QIDQ5013351
José L. Ramírez, Rigoberto Flórez, Sergi Elizalde
Publication date: 30 November 2021
Published in: Ars Mathematica Contemporanea (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.26493/1855-3974.2478.d1b
Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)
Related Items
A refinement of Dyck paths: A combinatorial approach, Unnamed Item, Enumerating symmetric pyramids in Motzkin paths, Unnamed Item
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Some enumerations on non-decreasing Dyck paths
- Sequence characterization of Riordan arrays
- The Riordan group
- Pascal triangles, Catalan numbers and renewal arrays
- Two combinatorial statistics on Dyck paths
- Nondecreasing Dyck paths and \(q\)-Fibonacci numbers
- Enumerations of peaks and valleys on non-decreasing Dyck paths
- A bijection between directed column-convex polyominoes and ordered trees of height at most three
- Enumerating symmetric and asymmetric peaks in Dyck paths
- Symmetric peaks and symmetric valleys in Dyck paths
- Enumerations of rational non-decreasing Dyck paths with integer slope
- Measuring symmetry in lattice paths and partitions
- Enumerating several aspects of non-decreasing Dyck paths
- Hipparchus, Plutarch, Schroder, and Hough
- On Some Alternative Characterizations of Riordan Arrays
- Directed column-convex polyominoes by recurrence relations
- WORDS, DYCK PATHS, TREES, AND BIJECTIONS
