RUS  ENG
Full version
JOURNALS // Diskretnaya Matematika // Archive

Diskr. Mat., 2022 Volume 34, Issue 1, Pages 3–19 (Mi dm1670)

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.

UDC: 519.115

Received: 01.09.2021

DOI: 10.4213/dm1670


 English version:
Discrete Mathematics and Applications, 2022, 32:2, 75–89

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2026