Counting \(k\)-convex polyominoes (Q396773)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Counting k-convex polyominoes |
scientific article; zbMATH DE number 6330264
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Counting \(k\)-convex polyominoes |
scientific article; zbMATH DE number 6330264 |
Statements
Counting \(k\)-convex polyominoes (English)
0 references
14 August 2014
0 references
Summary: We compute an asymptotic estimate of a lower bound of the number of \(k\)-convex polyominoes of semiperimeter \(p\). This approximation can be written as \(\mu(k) p 4^p\) where \(\mu(k)\) is a rational fraction of \(k\) which up to \(\mu(k)\) is the asymptotics of convex polyominoes.
0 references
convex polyominoes
0 references
0 references
0.9295269
0 references
0.9292859
0 references
0.9292859
0 references
0.9149505
0 references
0.91365874
0 references
0 references
0 references
