A decomposition of column-convex polyominoes and two vertex statistics
From MaRDI portal
Publication:2155173
DOI10.1007/s11786-022-00528-5OpenAlexW4293230678WikidataQ130258099 ScholiaQ130258099MaRDI QIDQ2155173
Nenad P. Cakić, Toufik Mansour, Gökhan Yıldırım
Publication date: 15 July 2022
Published in: Mathematics in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11786-022-00528-5
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Set partition asymptotics and a conjecture of Gould and Quaintance
- Generating functions for generating trees
- Algebraic languages and polyominoes enumeration
- Generating functions for inscribed polyominoes
- Interior vertices in set partitions
- On column-convex and convex Carlitz polyominoes
- Counting corners in partitions
- Combinatorial Problems Suggested by the Statistical Mechanics of Domains and of Rubber-Like Molecules
- Contributions to the Cell Growth Problem
- Probabilistic analysis of column-convex and directed diagonally-convex animals
- Statistics of lattice animals (polyominoes) and polygons
- Counting corners in compositions and set partitions presented as bargraphs
- Enumerating 2D percolation series by the finite-lattice method: theory
- Enumerations of bargraphs with respect to corner statistics
- Combinatorial parameters in bargraphs
- Perimeter generating function for row-convex polygons on the rectangular lattice
- Checker Boards and Polyominoes
- Enumerations of lattice animals and trees
This page was built for publication: A decomposition of column-convex polyominoes and two vertex statistics
