Accession Number : AD0755138

Title :   Asymptotic Bounds for the Number of Convex n-Ominoes.

Descriptive Note : Technical rept.,

Corporate Author : STANFORD UNIV CALIF DEPT OF COMPUTER SCIENCE

Personal Author(s) : Klarner,David A. ; Rivest,Ronald L.

Report Date : DEC 1972

Pagination or Media Count : 18

Abstract : Unit squares having their vertices at integer points in the Cartesian plane are called cells. A point set equal to a union of n distinct cells which is connected and has no finite cut set is called an n-omino. Two n-ominoes are considered the same if one is mapped onto the other by some translation of the plane. An n-omino is convex if all cells in a row or column form a connected strip. Letting c(n) denote the number of different convex n-ominoes, the authors show that the sequence ((c(n))(sup 1/n): n = 1,2,...) tends to a limit gamma, and gamma = 2.309138... .(Author)

Descriptors :   (*CONVEX SETS, SEQUENCES(MATHEMATICS)), MAPPING(TRANSFORMATIONS), MATRICES(MATHEMATICS), POLYNOMIALS, DIFFERENCE EQUATIONS

Subject Categories : Theoretical Mathematics

Distribution Statement : APPROVED FOR PUBLIC RELEASE