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 perimeter enumerat ...
Article

A perimeter enumeration of column-convex polyominoes

Svjetlan Feretić ORCID (1)
(1) Faculty of Civil Engineering [Rijeka]
Download article
Open on HAL
Imported on
March 26, 2015
Published on
January 1, 2007
Last modified on
March 31, 2025
Volume 9
vol. 9:1
Combinatorics
DOI
10.46298/dmtcs.390
License
https://about.hal.science/hal-authorisation-v1
Indicators
1164
Views
1076
Downloads

A perimeter enumeration of column-convex polyominoes

Svjetlan Feretić ORCID (1)
(1) Faculty of Civil Engineering [Rijeka]
Abstract
This work is concerned with the perimeter enumeration of column-convex polyominoes. We consider both the rectangular lattice and the hexagonal lattice. For the rectangular lattice, two formulas for the generating function (gf) already exist and, to all appearances, neither of them admits of a further simplification. We first rederive those two formulas (so as to make the paper self-contained), and then we enrich the rectangular lattice gf with some additional variables. That done, we make a change of variables, which (practically) produces the hexagonal lattice gf. This latter gf was first found by Lin and Wu in 1990. However, our present formula, in addition to having a simpler form, also allows a substantially easier Taylor series expansion. As to the methods, our one is descended from algebraic languages, whereas Lin and Wu used the Temperley methodology.
Keywords
  • [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
Cited by

Source: OpenCitations

  • A New Algorithm Based on Colouring Arguments for Identifying Impossible Polyomino Tiling Problems

    Algorithms

    Authors : Marcus R. Garvie ORCID, John Burkardt ORCID

    Journal reference : Volume 15, 2022, pp. 65

    DOI : 10.3390/a15020065
  • The perimeter of uniform and geometric words: a probabilistic analysis

    arXiv (Cornell University)

    Authors : Guy Louchard

    Journal reference : Volume 42, 2018, pp. 733-748

    DOI : 10.2989/16073606.2018.1497723
  • A Parallelizable Integer Linear Programming Approach for Tiling Finite Regions of the Plane with Polyominoes

    Algorithms

    Authors : Marcus R. Garvie ORCID, John Burkardt ORCID

    Journal reference : Volume 15, 2022, pp. 164

    DOI : 10.3390/a15050164
  • Smooth squared, triangular, and hexagonal bargraphs

    Applicable Analysis and Discrete Mathematics

    Authors : Toufik Mansour ORCID

    Journal reference : Volume 18, 2024, pp. 215-228

    DOI : 10.2298/aadm220603003m
Preview
Loading PDF preview...