|
The site-perimeter of compositions
A. Blecher, Ch. Brennan, A. Knopfmacher University of the Witwatersrand, Johannesburg
Abstract:
Compositions of $n$ are finite sequences of positive integers $(\sigma_i)_{i=1}^k$ such that \[\sigma_1+\sigma_2+\cdots +\sigma_k=n.\] We represent a composition of $n$ as a bargraph with area $n$ such that the height of the $i$-th column of the bargraph equals the size of the $i$-th part of the composition. We consider the site-perimeter which is the number of nearest-neighbour cells outside the boundary of the polyomino. The generating function that counts the total site-perimeter of compositions is obtained. In addition, we rederive the average site-perimeter of a composition by direct counting. Finally we determine the average site-perimeter of a bargraph with a given semi-perimeter.
Keywords:
bargraphs, site-perimeter, compositions, generating functions, asymptotics.
Received: 01.09.2021
Citation:
A. Blecher, Ch. Brennan, A. Knopfmacher, “The site-perimeter of compositions”, Diskr. Mat., 34:1 (2022), 3–19; Discrete Math. Appl., 32:2 (2022), 75–89
Linking options:
https://www.mathnet.ru/eng/dm1670https://doi.org/10.4213/dm1670 https://www.mathnet.ru/eng/dm/v34/i1/p3
|
Statistics & downloads: |
Abstract page: | 283 | Full-text PDF : | 68 | References: | 79 | First page: | 15 |
|