A new way of counting the column-convex polyominoes by perimeter
From MaRDI portal
Publication:1381823
DOI10.1016/S0012-365X(97)00114-3zbMath0894.05010MaRDI QIDQ1381823
Publication date: 18 June 1998
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items (8)
Unnamed Item ⋮ A method for the enumeration of various classes of column-convex polygons ⋮ Convex polyominoes revisited: enumeration of outer site perimeter, interior vertices, and boundary vertices of certain degrees ⋮ Families of \(m\)-convex polygons: \(m=1\) ⋮ The perimeter of words ⋮ Polynomial equations with one catalytic variable, algebraic series and map enumeration ⋮ Exactly Solved Models ⋮ \(Q\)-grammars and wall polyominoes
Cites Work
- Unnamed Item
- Unnamed Item
- A combinatorial proof of the multivariable Lagrange inversion formula
- Algebraic languages and polyominoes enumeration
- Generating functions for column-convex polyominoes
- A method for the enumeration of various classes of column-convex polygons
- Combinatorial Problems Suggested by the Statistical Mechanics of Domains and of Rubber-Like Molecules
- Exact solution of the row-convex polygon perimeter generating function
- Exact solution of the staircase and row-convex polygon perimeter and area generating function
- Convex polyominoes and algebraic languages
- On the number of certain lattice polygons
- On context-free languages and push-down automata
- Perimeter generating function for row-convex polygons on the rectangular lattice
This page was built for publication: A new way of counting the column-convex polyominoes by perimeter