Abstract (EN):
Although the exact counting and enumeration of polyominoes remain challenging open problems, several positive results were achieved for special classes of polyominoes. We give an algorithm for direct enumeration of <em>permutominoes</em> [IUncitti, 2006] by size, or, equivalently, for the enumeration of <em> grid orthogonal polygons</em> [Tomás and Bajuelos, 2004]. We show how the construction technique allows us to derive a simple characterization of the class of convex permutominoes, which has been extensively
investigated recently [Boldi et al, 2007]. The approach extends to some of its subclasses, namely to the row convex and the directed convex permutominoes.
Language:
English
Type (Professor's evaluation):
Scientific
Notes:
http://congreso.us.es/ecgeometry/proceedingsECG2013.pdf <br>
Partially supported by projects PEst-C/MAT/UI0144/2011 (FEDER/COMPETE/FCT) and JEDI (PTDC/EIA/66924/2006).<br>
Versão preliminar de trabalho publicado posteriormente.