Alain Goupil ; Hugo Cloutier ; Fathallah Nouboud - Enumeration of inscribed polyominos

dmtcs:2808 - Discrete Mathematics & Theoretical Computer Science, January 1, 2010, DMTCS Proceedings vol. AN, 22nd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2010) - https://doi.org/10.46298/dmtcs.2808
Enumeration of inscribed polyominosArticle

Authors: Alain Goupil 1; Hugo Cloutier 1; Fathallah Nouboud 1

  • 1 Département de mathématiques et d’informatique

We introduce a new family of polyominos that are inscribed in a rectangle of given size for which we establish a number of exact formulas and generating functions. In particular, we study polyominos inscribed in a rectangle with minimum area and minimum area plus one. These results are then used for the enumeration of lattice trees inscribed in a rectangle with minimum area plus one.

https://doi.org/10.46298/dmtcs.2808
Source: HAL:hal-01186234v1
Volume: DMTCS Proceedings vol. AN, 22nd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2010)
Section: Proceedings
Published on: January 1, 2010
Imported on: January 31, 2017
Keywords: minimal area.,lattice tree,inscribed polyomino,enumeration,rectangle,generating function,[MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO],[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM],[INFO.INFO-HC] Computer Science [cs]/Human-Computer Interaction [cs.HC]
Funding:
    Source : OpenAIRE Graph
  • Funder: Natural Sciences and Engineering Research Council of Canada

Share and export

Consultation statistics

This page has been seen 302 times.
This article's PDF has been downloaded 212 times.