# 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):

# Report Date:

## 1972-12-01

# Pagination or Media Count:

## 18.0

# 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 cn denote the number of different convex n-ominoes, the authors show that the sequence cnsup 1n n 1,2,... tends to a limit gamma, and gamma 2.309138... .Author

# Descriptors:

# Subject Categories:

- Theoretical Mathematics