Bargraphs are lattice paths in N-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 pi(1)pi(2) . . . pi(m) such that column j contains pi(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.
机构:
Ton Duc Thang Univ, Inst Computat Sci, Ho Chi Minh City, Vietnam
Ton Duc Thang Univ, Fac Math & Stat, Ho Chi Minh City, VietnamUniv Haifa, Dept Math, IL-3498838 Haifa, Israel
机构:
Ton Duc Thang Univ, Inst Computat Sci, Ho Chi Minh City, Vietnam
Ton Duc Thang Univ, Fac Math & Stat, Ho Chi Minh City, VietnamUniv Haifa, Dept Math, Haifa, Israel