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. The number of direct ...
Conference paper

The number of directed $k$-convex polyominoes

Adrien Boussicault (1), Simone Rinaldi (2), Samanta Socci (2)
(1) Laboratoire Bordelais de Recherche en Informatique
(2) Dipartimento di Ingegneria dell'informazione e scienze matematiche [Siena]
Download article
Open on HAL
Imported on
November 21, 2016
Published on
December 31, 2014
Last modified on
March 31, 2025
Volume
DMTCS Proceedings, 27th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2015)
Proceedings
DOI
10.46298/dmtcs.2465
License
Attribution 4.0 International (CC BY 4.0)
Indicators
936
Views
575
Downloads

The number of directed $k$-convex polyominoes

Adrien Boussicault (1), Simone Rinaldi (2), Samanta Socci (2)
(1) Laboratoire Bordelais de Recherche en Informatique
(2) Dipartimento di Ingegneria dell'informazione e scienze matematiche [Siena]
Abstract
English
We present a new method to obtain the generating functions for directed convex polyominoes according to several different statistics including: width, height, size of last column/row and number of corners. This method can be used to study different families of directed convex polyominoes: symmetric polyominoes, parallelogram polyominoes. In this paper, we apply our method to determine the generating function for directed $k$-convex polyominoes.We show it is a rational function and we study its asymptotic behavior.
French
Nous présentons une nouvelle méthode générique pour obtenir facilement et rapidement les fonctions génératrices des polyominos dirigés convexes avec différentes combinaisons de statistiques : hauteur, largeur, longueur de la dernière ligne/colonne et nombre de coins. La méthode peut être utilisée pour énumérer différentes familles de polyominos dirigés convexes: les polyominos symétriques, les polyominos parallélogrammes. De cette façon, nouscalculons la fonction génératrice des polyominos dirigés $k$-convexes, nous montrons qu’elle est rationnelle et nous étudions son comportement asymptotique.
Keywords
  • [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
  • Parallelogram polyomino
  • directed convex polyomino
  • degree of convexity
  • tree
  • path
  • generating function.
Cited by

Source: OpenCitations

  • The number of directed k -convex polyominoes

    Discrete Mathematics

    Authors : A. Boussicault, S. Rinaldi, S. Socci

    Journal reference : Volume 343, 2019, pp. 111731

    DOI : 10.1016/j.disc.2019.111731
  • Periodic parallelogram polyominoes

    Electronic Notes in Discrete Mathematics

    Authors : Adrien Boussicault, Patxi Laborde-Zubieta

    Journal reference : Volume 59, 2017, pp. 177-188

    DOI : 10.1016/j.endm.2017.05.013
Preview
Loading PDF preview...