Convex n-ominoes
暂无分享,去创建一个
Unit squares having their vertices at integer points in the Carresian plane are called cells. A connected union of n distinct cells having no finite cut set is an n-omino. Two n-ominoes are the same if one is mapped onto the other by a translation of the plane. An n-omino is convex if the cells in each row and each column to an a connected strip. When viewed from a distance, most convex n-ominoes resemble rods tilted 45^o from the vertical with horizontal (and vertical) thickness roughly equal to 2.37597. If c(n) denotes the number of convex n-ominoes, then c(n) ~ fy^n, where y = 2.30914 and f = 2.67564. (It is understood that all constants are accurate to within -12 in the last place.)
[1] D. Klarner,et al. A combinatorial formula involving the Fredholm integral equation , 1968 .
[2] Ronald L. Rivest,et al. Asymptotic bounds for the number of convex n-ominoes , 1974, Discret. Math..
[3] Edward A. Bender,et al. Central and Local Limit Theorems Applied to Asymptotic Enumeration , 1973, J. Comb. Theory A.
[4] D. Klarner,et al. The diagonal of a double power series , 1971 .