Counting lattice points on bargraphs of Catalan words
From MaRDI portal
Publication:2071531
DOI10.1007/s11786-021-00501-8OpenAlexW3131109024MaRDI QIDQ2071531
Toufik Mansour, José L. Ramírez, Diana A. Toquica
Publication date: 28 January 2022
Published in: Mathematics in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11786-021-00501-8
Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19)
Related Items (5)
Descent distribution on Catalan words avoiding ordered pairs of relations ⋮ Parameters in inversion sequences ⋮ Consecutive patterns in Catalan words and the descent distribution ⋮ Unnamed Item ⋮ Unnamed Item
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Descent distribution on Catalan words avoiding a pattern of length at most three
- Polygons, polyominoes and polycubes
- Interior vertices in set partitions
- Efficient generation of restricted growth words
- Computing the Continuous Discretely
- Levels in bargraphs
- Catalan words avoiding pairs of length three patterns
- Convex polyominoes revisited: enumeration of outer site perimeter, interior vertices, and boundary vertices of certain degrees
- Catalan Numbers
- Combinatorial parameters in bargraphs
This page was built for publication: Counting lattice points on bargraphs of Catalan words
