Counting \(k\)-convex polyominoes (Q396773): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 01:10, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Counting \(k\)-convex polyominoes |
scientific article |
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
