Metraipolis › archive › dc_c747f55144aa

Enumeration of $k$-convex polyominoes by semi-perimeter — arXiv:2611.02072

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.02072
License (as archived)
CC0-1.0
Archived
2026-11-03T11:37:31.172Z
SHA-256 of the archived text
e501d0d9bfaae6ac6ff34eaaa6bd140961ba79cef8342a382a701d64e1eb5f6c
Stable URL of this page
https://metraipolis.com/documento/dc_c747f55144aa

How to cite

Enumeration of $k$-convex polyominoes by semi-perimeter — arXiv:2611.02072 — arXiv (en), https://arxiv.org/abs/2611.02072 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_c747f55144aa (Metraipolis archive dc_c747f55144aa, sha256 e501d0d9bfaae6ac6ff34eaaa6bd140961ba79cef8342a382a701d64e1eb5f6c)
BibTeX
@misc{dcc747f55144aa,
  title = {Enumeration of $k$-convex polyominoes by semi-perimeter — arXiv:2611.02072},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.02072},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_c747f55144aa; sha256 e501d0d9bfaae6ac6ff34eaaa6bd140961ba79cef8342a382a701d64e1eb5f6c},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.02072. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We prove the Conway--Guttmann formula for the generating function of $k$-convex polyominoes by semi-perimeter, for every $k\ge2$. A decomposition according to the two diagonal directions reduces the enumeration to convex polyominoes satisfying a one-bend condition in one diagonal direction. Splitting these polyominoes at the right endpoint of the top row leaves an initial part followed by columns whose vertical intervals decrease by inclusion. Ordered forests describe the initial part and retain the row information needed to determine when column extensions first exceed the prescribed bound. A first-passage calculation, together with a sum over initial parts already above the bound, gives the required generating function. The argument includes the case $k=2$.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2611.02072 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-03T11:05:22.295Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).