Generating functions for column-convex polyominoes
From MaRDI portal
Publication:1813084
DOI10.1016/0097-3165(88)90071-4zbMath0736.05030OpenAlexW2014831433WikidataQ56112479 ScholiaQ56112479MaRDI QIDQ1813084
Publication date: 25 June 1992
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0097-3165(88)90071-4
Related Items (17)
Algebraic languages and polyominoes enumeration ⋮ Unnamed Item ⋮ Enumeration of polyominoes using Macsyma ⋮ Enumeriation of parallelogram polyominoes with given bond and site perimeter ⋮ Exact scaling behavior of partially convex vesicles ⋮ A combinatorial method for the enumeration of column-convex polyominoes ⋮ A method for the enumeration of various classes of column-convex polygons ⋮ A new way of counting the column-convex polyominoes by perimeter ⋮ Region selection in Markov random fields: Gaussian case ⋮ The perimeter generating function for nondirected diagonally convex polyominoes ⋮ Families of \(m\)-convex polygons: \(m=1\) ⋮ Enumeration of symmetry classes of convex polyominoes in the square lattice ⋮ Exactly Solved Models ⋮ Enumeration of three-dimensional convex polygons ⋮ Large deviations of convex polyominoes ⋮ Coding the convex polyominoes and equations for the enumeration according to the area ⋮ \(q\)-enumeration of convex polyominoes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Counting polyominoes: yet another attack
- Algebraic languages and polyominoes enumeration
- Convex n-ominoes
- Asymptotic bounds for the number of convex \(n\)-ominoes
- Planar Maps are Well Labeled Trees
- Contributions to the Cell Growth Problem
- A Noncommutative Generalization and q-Analog of the Lagrange Inversion Formula
- On the number of certain lattice polygons
- Tiling with polyominoes
- Cell Growth Problems
- On context-free languages and push-down automata
This page was built for publication: Generating functions for column-convex polyominoes
