Counting \(k\)-convex polyominoes (Q396773): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q3415007 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Convex n-ominoes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Reconstruction of L-convex Polyominoes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Enumeration of L-convex polyominoes by rows and columns / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Algebraic languages and polyominoes enumeration / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The number of Z-convex polyominoes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Checker Boards and Polyominoes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Procedure for Improving the Upper Bound for the Number of <i>n</i>-Ominoes / rank | |||
Normal rank |
Latest revision as of 22:15, 8 July 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