Restricted bargraphs and unimodal compositions
From MaRDI portal
Publication:6612122
DOI10.1016/j.jcta.2024.105934zbMATH Open1548.0508MaRDI QIDQ6612122
Rigoberto Flórez, José L. Ramírez, Diego Villamizar
Publication date: 30 September 2024
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Some enumerations on non-decreasing Dyck paths
- Statistics on bargraphs viewed as cornerless Motzkin paths
- Polygons, polyominoes and polycubes
- Nondecreasing Dyck paths and \(q\)-Fibonacci numbers
- The site-perimeter of bargraphs
- A bijection between directed column-convex polyominoes and ordered trees of height at most three
- A method for the enumeration of various classes of column-convex polygons
- Dyson's crank and unimodal compositions
- Inverse series relations and other expansions involving Humbert polynomials
- Combinatorial Problems Suggested by the Statistical Mechanics of Domains and of Rubber-Like Molecules
- Enumerating symmetric peaks in non-decreasing Dyck paths
- Combinations as Bargraphs
- WORDS, DYCK PATHS, TREES, AND BIJECTIONS
- Semi-perimeter and inner site-perimeter of k-ary words and bargraphs
- Counting water cells in bargraphs of compositions and set partitions
- Combinatorial parameters in bargraphs
- Checker Boards and Polyominoes
This page was built for publication: Restricted bargraphs and unimodal compositions
