Counting Polyominoes, Revisited
Algorithmica · 2026-06 · 88 (3)
DOI: 10.1007/s00453-026-01392-6 ↗Kurz gefasst
Fachartikel in der Zeitschrift Algorithmica, online erschienen am 03.06.2026. Verfasst von Gill Barequet und 1 weiteren Autor:innen. Die Arbeit nennt 18 Literaturangaben. Gefördert von: United States - Israel Binational Science Foundation.
Abstract (Originalsprache)
A polyomino is an edge-connected set of squares on the square lattice. In this paper, we improve the Conway-Jensen polyomino-counting algorithm by considering bounding boxes on the square lattice rotated by 45∘\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$45^\circ $$\end{document} instead of on the regular unrotated lattice. This allows us to extend significantly the count of polyominoes from 56 to 70 terms.
Förderung
- United States - Israel Binational Science Foundation
Zitieren
APA
Barequet, G., & Ben-Shachar, G. (2026). Counting Polyominoes, Revisited. Algorithmica, 88(3). https://doi.org/10.1007/s00453-026-01392-6
Vancouver
Barequet G, Ben-Shachar G. Counting Polyominoes, Revisited. Algorithmica. 2026;88(3). doi:10.1007/s00453-026-01392-6
BibTeX
@article{Barequet2026,
author = {Barequet, Gill and Ben-Shachar, Gil},
title = {Counting Polyominoes, Revisited},
journal = {Algorithmica},
year = {2026},
volume = {88},
number = {3},
doi = {10.1007/s00453-026-01392-6}
}
EUVIMED