English

On the enumeration of k-omino towers

Combinatorics 2019-10-07 v2

Abstract

We describe a class of fixed polyominoes called kk-omino towers that are created by stacking rectangular blocks of size k×1k\times 1 on a convex base composed of these same kk-omino blocks. By applying a partition to the set of kk-omino towers of fixed area knkn, we give a recurrence on the kk-omino towers therefore showing the set of kk-omino towers is enumerated by a Gauss hypergeometric function. The proof in this case implies a more general hypergeometric identity with parameters similar to those given in a classical result of Kummer.

Keywords

Cite

@article{arxiv.1608.01563,
  title  = {On the enumeration of k-omino towers},
  author = {Tricia Muldoon Brown},
  journal= {arXiv preprint arXiv:1608.01563},
  year   = {2019}
}