 |
Discrete Mathematics & Theoretical Computer Science |
A. del Lungo ; E. Duchi ; A. Frosini ; S. Rinaldi - Enumeration of convex polyominoes using the ECO method
dmtcs:2307 - Discrete Mathematics & Theoretical Computer Science, January 1, 2003, DMTCS Proceedings vol. AB, Discrete Models for Complex Systems (DMCS'03) - https://doi.org/10.46298/dmtcs.2307Enumeration of convex polyominoes using the ECO methodConference paper
- 1 Università degli Studi di Firenze = University of Florence [UniFI]
- 2 Università degli Studi di Firenze = University of Florence = Université de Florence
- 3 Department of Mathematics and Computer Science / Dipartimento di Scienze Matematiche e Informatiche "Roberto Magari"
ECO is a method for the enumeration of classes of combinatorial objects based on recursive constructions of such classes. In the first part of this paper we present a construction for the class of convex polyominoes based on the ECO method. Then we translate this construction into a succession rule. The final goal of the paper is to determine the generating function of convex polyominoes according to the semi-perimeter, and it is achieved by applying an idea introduced in [11].
Source: HAL:hal-01183315v1
Volume: DMTCS Proceedings vol. AB, Discrete Models for Complex Systems (DMCS'03)
Section: Proceedings
Published on: January 1, 2003
Imported on: November 21, 2016
Keywords: [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO], [NLIN.NLIN-CG]Nonlinear Sciences [physics]/Cellular Automata and Lattice Gases [nlin.CG], [en] convex polyominoes, ECO method, succession rules, kernel method, generating functions
Classifications
Mathematics Subject Classification 20201
Publications
1 Document citing this article
Consultation statistics
This page has been seen 480 times.
This article's PDF has been downloaded 464 times.