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. A Bijection for Dire ...
Conference paper

A Bijection for Directed-Convex Polyominoes

Alberto del Lungo, Massimo Mirolli (1), Renzo Pinzani (2), Simone Rinaldi (2)
(1) Department of Mathematics and Computer Science / Dipartimento di Scienze Matematiche e Informatiche "Roberto Magari"
(2) Dipartimento di Sistemi e Informatica
Download article
Open on HAL
Imported on
November 21, 2016
Published on
December 31, 2000
Last modified on
March 31, 2025
Volume 0
DMTCS Proceedings vol. AA, Discrete Models: Combinatorics, Computation, and Geometry (DM-CCG 2001)
Proceedings
DOI
10.46298/dmtcs.2298
License
https://about.hal.science/hal-authorisation-v1
Indicators
759
Views
576
Downloads

A Bijection for Directed-Convex Polyominoes

Alberto del Lungo, Massimo Mirolli (1), Renzo Pinzani (2), Simone Rinaldi (2)
(1) Department of Mathematics and Computer Science / Dipartimento di Scienze Matematiche e Informatiche "Roberto Magari"
(2) Dipartimento di Sistemi e Informatica
Abstract
In this paper we consider two classes of lattice paths on the plane which use \textitnorth, \textiteast, \textitsouth,and \textitwest unitary steps, beginningand ending at (0,0).We enumerate them according to the number ofsteps by means of bijective arguments; in particular, we apply the cycle lemma.Then, using these results, we provide a bijective proof for the number of directed-convex polyominoes having a fixed number of rows and columns.
Keywords
  • [INFO]Computer Science [cs]
  • [INFO.INFO-CG]Computer Science [cs]/Computational Geometry [cs.CG]
  • [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
  • [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]
  • cycle lemma
  • directed-convex polyominoes
  • binomial coefficients
  • lattice paths
Cited by

Source: OpenCitations

  • On Column-Convex and Convex Carlitz Polyominoes

    arXiv (Cornell University)

    Authors : Toufik Mansour ORCID, Reza Rastegar ORCID, Armend Sh. Shabani ORCID

    Journal reference : Volume 15, 2021, pp. 889-898

    DOI : 10.1007/s11786-021-00518-z
  • From Linear Partitions to Parallelogram Polyominoes

    Lecture notes in computer science

    Authors : Roberto Mantaci, Paolo Massazza

    Journal reference : Volume , 2011, pp. 350-361

    DOI : 10.1007/978-3-642-22321-1_30
  • On the generation of convex polyominoes

    Discrete Applied Mathematics

    Authors : Paolo Massazza

    Journal reference : Volume 183, 2014, pp. 78-89

    DOI : 10.1016/j.dam.2014.02.014
  • Exactly Solved Models

    Lecture notes in physics

    Authors : Mireille Bousquet-Mélou ORCID, Richard Brak

    Journal reference : Volume , 2009, pp. 43-78

    DOI : 10.1007/978-1-4020-9927-4_3
  • On symmetric structures of order two

    Discrete Mathematics & Theoretical Computer Science

    Authors : Michel Bousquet, Cédric Lamathe

    Journal reference : Volume Vol. 10 no. 2, 2008, pp.

    DOI : 10.46298/dmtcs.420
  • A Decomposition of Column-Convex Polyominoes and Two Vertex Statistics

    Mathematics in Computer Science

    Authors : Nenad Cakić ORCID, Toufik Mansour ORCID, Gökhan Yıldırım ORCID

    Journal reference : Volume 16, 2022, pp.

    DOI : 10.1007/s11786-022-00528-5
  • Limit Distributions and Scaling Functions

    Lecture notes in physics

    Authors : Christoph Richard ORCID

    Journal reference : Volume , 2009, pp. 247-299

    DOI : 10.1007/978-1-4020-9927-4_11
Preview
Loading PDF preview...