Bargraphs are lattice paths in N_0^2, which start at the origin and terminate immediately upon return to the x-axis. The allowed steps are the up step (0,1), the down step (0,-1) and the horizontal step (1,0). The first step is an up step and the horizontal steps must all lie above the x-axis. An up step cannot follow a down step and vice versa. In this paper we consider levels, which are maximal sequences of two or more adjacent horizontal steps. We find the generating functions that count the total number of levels, the leftmost x-coordinate and the height of the first level and obtain the generating function for the mean of these parameters. Finally, we obtain the asymptotics of these means as the length of the path tends to infinity.
@article{600,
title = {Levels in bargraphs},
journal = {ARS MATHEMATICA CONTEMPORANEA},
volume = {11},
year = {2015},
doi = {10.26493/1855-3974.600.5d2},
language = {EN},
url = {http://dml.mathdoc.fr/item/600}
}
Blecher, Aubrey; Brennan, Charlotte; Knopfmacher, Arnold. Levels in bargraphs. ARS MATHEMATICA CONTEMPORANEA, Tome 11 (2015) . doi : 10.26493/1855-3974.600.5d2. http://gdmltest.u-ga.fr/item/600/