Skip to main contentSkip to search
Episciences
Open Access Journals
Sign in(new window)
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Sign in(new window)
Articles & Issues
All articlesAll accepted articlesAll volumesLast volumeSectionsSpecial issuesAuthors
About
The journalIndexing
Boards
Publish
For authorsEthical charter
Submit
Discrete Mathematics & Theoretical Computer Science logo
Contact
|
Credits
eISSN 1365-8050
|
RSS
|
Atom
Episciences
Documentation
|
Acknowledgements
|
Publishing policy
Accessibility: non-compliant
|
Legal mentions
|
Privacy statement
|
Terms of use
  1. Home > Articles & Issues >
  2. Articles >
  3. Enumeration of conve ...
Conference paper

Enumeration of convex polyominoes using the ECO method

A. del Lungo, E. Duchi (1) (2), A. Frosini (3), S. Rinaldi (3)
(1) Università degli Studi di Firenze = University of Florence
(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"
Download article
Open on HAL
Imported on
November 21, 2016
Published on
December 31, 2002
Last modified on
March 31, 2025
Volume 0
DMTCS Proceedings vol. AB, Discrete Models for Complex Systems (DMCS'03)
Proceedings
DOI
10.46298/dmtcs.2307
License
https://about.hal.science/hal-authorisation-v1
Indicators
730
Views
672
Downloads

Enumeration of convex polyominoes using the ECO method

A. del Lungo, E. Duchi (1) (2), A. Frosini (3), S. Rinaldi (3)
(1) Università degli Studi di Firenze = University of Florence
(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"
Abstract
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].
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]
  • convex polyominoes
  • ECO method
  • succession rules
  • kernel method
  • generating functions
Mathematics Subject Classification 2020
  • 05C38 - Paths and cycles
  • 05C65 - Hypergraphs
  • 05C85 - Graph algorithms (graph-theoretic aspects)
Linked publications - datasets - software
  • Has review

    Review available on zbMATH Open, by V. Yegnanarayanan (Chennai) (English)

Cited by

Source: OpenCitations

  • Convexity Preserving Contraction of Digital Sets

    Authors : Lama Tarsissi ORCID, David Coeurjolly ORCID, Yukiko Kenmochi ORCID, Pascal Romon ORCID

    Journal reference : Volume , 2020, pp. 611-624

    DOI : 10.1007/978-3-030-41299-9_48
Preview
Loading PDF preview...