Reservoirs in words over the alphabet \([k]\)
We represent words \(w_1 w_2\dots w_ n\) over the alphabet \([k]\) as bargraphs where the \(j\)th column of the bargraph is of height \(w_j\). The capacity of a word is the amount of water the bargraph would retain under the usual laws of physics when the water is allowed to escape left or right. A reservoir is a single body of water after all water has been allowed to escape under the same physical laws. For all words with \(n\) parts, generating functions are found which track the number of reservoirs, their total width, relationship to capacity and depth where the latter is defined as largest capacity of each single letter in the reservoir.
Authors
- Arnold Knopfmacher (ORCID: https://orcid.org/0000-0003-1962-043X)
- Aubrey Blecher (ORCID: https://orcid.org/0000-0003-2487-3220)
Institutions
- University of the Witwatersrand (ZA)
Publication Details
- Journal
- Online Journal of Analytic Combinatorics
- Published
- 2026-11-15
- DOI
- https://doi.org/10.61091/ojac21-07
- Primary Topic
- Advanced Combinatorial Mathematics
- Type
- article
- Field-Weighted Citation Impact
- 0.00