English

Enumerations and Bijections for Stanley Polyominoes

Combinatorics 2026-04-15 v1

Abstract

Stanley polyominoes are a subclass of parallelogram polyominoes in which each row begins strictly to the right of the beginning of the previous row and ends strictly to the right of the end of the previous row. In this paper, we derive generating functions for Stanley polyominoes based on the numbers of columns and rows, area, semiperimeter, and numbers of interior points and edges. We also establish combinatorial connections through bijections with other combinatorial structures such as Dyck paths, skew Ferrer diagrams, and peakless Motzkin paths. As a byproduct, we answer the open question of finding a bijection between parallelogram polyominoes of area nn and coin fountains with nn coins in the even-numbered rows and nkn-k coins in the odd-numbered rows.

Keywords

Cite

@article{arxiv.2604.12392,
  title  = {Enumerations and Bijections for Stanley Polyominoes},
  author = {Jean-Luc Baril and Aubrey Blecher and José Luis ramírez},
  journal= {arXiv preprint arXiv:2604.12392},
  year   = {2026}
}
R2 v1 2026-07-01T12:08:11.266Z