The number of convex polyominos with given perimeter
โ Scribed by Dongsu Kim
- Publisher
- Elsevier Science
- Year
- 1988
- Tongue
- English
- Weight
- 387 KB
- Volume
- 70
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
โฆ Synopsis
An elementary proof is given for the number of convex polyominos of perimeter 2m =t 4.
Let
+4 denote the number of nonisomo perimeter 2m + 4, m 3 2. elest and Viennot olyominos with P h+4 = (2nr + 7)2ti-4 -4(2ne -3,(ZJ.
๐ SIMILAR VOLUMES
This paper concerns the enumeration of rotation-type and congruence-type convex polyominoes on the square lattice. These can be defined as orbits of the ลฝ groups แ , of rotations, and แ , of symmetries, of the square, acting on transla-4 4 . tion-type polyominoes. By virtue of Burnside's lemma, it i
We give a 'beautiful' though complex -formula for the generating function Z of convex polyominoes, according to their area, width and height. Our method consists in solving a linear q-differential system of size three, which was derived two years ago by encoding convex polyominoes with the words of