Enumeration of the directed convex polyominoes (Q1924360)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 935373
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Enumeration of the directed convex polyominoes |
scientific article; zbMATH DE number 935373 |
Statements
Enumeration of the directed convex polyominoes (English)
0 references
9 December 1996
0 references
A directed convex polyomino is defined and a recurrence relation for the generating function defined by examining all the different ways in which a polynomino can be extended by adding another column. Solving the recurrence relation enables an explicit expression for the generating function to be given. The work can be specialized to enumerating various subfamilies of convex polyominoes, in particular to enumerating Ferrers graphs.
0 references
enumeration
0 references
directed convex polyomino
0 references
generating function
0 references
Ferrers graphs
0 references
0 references
0 references
0.8565471172332764
0 references
0.849249541759491
0 references
0.8333556056022644
0 references
0.8333556056022644
0 references
0.8252943158149719
0 references
