Abstract
Bargraphs are lattice paths in ℕ0 2 that start at the origin and end upon their first return to the x-axis. Each bargraph is represented by a sequence of column heights π1π2...πm such that column j contains πj cells. In this paper, we study the number of bargraphs with n cells and m columns according to the distribution for the statistic that records the number of times a given shape lies entirely within a bargraph for various small shapes.
Original language | English |
---|---|
Pages (from-to) | 2763-2773 |
Number of pages | 11 |
Journal | Turkish Journal of Mathematics |
Volume | 42 |
Issue number | 5 |
DOIs | |
State | Published - 2018 |
Bibliographical note
Publisher Copyright:© TÜBI˙TAK.
Keywords
- Bargraphs
- C-vertices
- Combinatorial statistic
- Generating functions
ASJC Scopus subject areas
- General Mathematics