On the Counting Sequence of Z-convex Polyominoes
Electronic Proceedings in Theoretical Computer Science · 2026-06-07 · 445 · 57-65
DOI: 10.4204/eptcs.445.8 ↗At a glance
Journal article in Electronic Proceedings in Theoretical Computer Science, published online on 2026-06-07. Written by Luca Castelli and 1 co-authors. 14 references.
Abstract (original language)
The degree of convexity of a convex polyomino P is the smallest integer k such that any two cells of P can be joined by a monotone path inside P with at most k changes of direction. In this paper, we present a set of formulas and equations that are the basis of a C++ program that allows you to compute the longest counting sequence known to date (with respect to the area) of convex polyominoes of degree of convexity at most 2
Cite
APA
Castelli, L., & Massazza, P. (2026). On the Counting Sequence of Z-convex Polyominoes. Electronic Proceedings in Theoretical Computer Science, 445, 57-65. https://doi.org/10.4204/eptcs.445.8
Vancouver
Castelli L, Massazza P. On the Counting Sequence of Z-convex Polyominoes. Electronic Proceedings in Theoretical Computer Science. 2026;445:57-65. doi:10.4204/eptcs.445.8
BibTeX
@article{Castelli2026,
author = {Castelli, Luca and Massazza, Paolo},
title = {On the Counting Sequence of Z-convex Polyominoes},
journal = {Electronic Proceedings in Theoretical Computer Science},
year = {2026},
volume = {445},
pages = {57--65},
doi = {10.4204/eptcs.445.8}
}
EUVIMED