The perimeter of words |
| |
Authors: | Aubrey Blecher Charlotte Brennan Arnold Knopfmacher Toufik Mansour |
| |
Affiliation: | 1. The John Knopfmacher Centre for Applicable Analysis and Number Theory, School of Mathematics, University of the Witwatersrand, Private Bag 3, Wits 2050, Johannesburg, South Africa;2. Department of Mathematics, University of Haifa, 3498838 Haifa, Israel |
| |
Abstract: | We define to be a (totally ordered) alphabet on letters. A word of length on the alphabet is an element of . A word can be represented by a bargraph (i.e., by a column-convex polyomino whose lower edges lie on the -axis) in which the height of the th column equals the size of the th part of the word. Thus these bargraphs have heights which are less than or equal to . We consider the perimeter, which is the number of edges on the boundary of the bargraph. By way of Cramer’s method and the kernel method, we obtain the generating function that counts the perimeter of words. Using these generating functions we find the average perimeter of words of length over the alphabet . We also show how the mean and variance can be obtained using a direct counting method. |
| |
Keywords: | Words Bargraphs Perimeter Generating functions Narayana numbers |
本文献已被 ScienceDirect 等数据库收录! |
|