On column-convex and convex Carlitz polyominoes
From MaRDI portal
Publication:2071544
DOI10.1007/s11786-021-00518-zOpenAlexW3197910685MaRDI QIDQ2071544
Armend Sh. Shabani, Toufik Mansour, Reza Rastegar
Publication date: 28 January 2022
Published in: Mathematics in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2102.00445
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Polygons, polyominoes and polycubes
- Tiling figures of the plane with two bars
- Generating functions for generating trees
- Algebraic languages and polyominoes enumeration
- Difference equations in statistical mechanics. I: Cluster statistics models.
- A decomposition of column-convex polyominoes and two vertex statistics
- Smooth column convex polyominoes
- The number of directed \(k\)-convex polyominoes
- Combinatorial Problems Suggested by the Statistical Mechanics of Domains and of Rubber-Like Molecules
- Statistics of lattice animals (polyominoes) and polygons
- Enumerating 2D percolation series by the finite-lattice method: theory
- Convex polyominoes revisited: enumeration of outer site perimeter, interior vertices, and boundary vertices of certain degrees
- Packing a rectangle with congruent N-ominoes
- The undecidability of the domino problem
- Checker Boards and Polyominoes
- Enumerations of lattice animals and trees
