Hostname: page-component-cd9895bd7-hc48f Total loading time: 0 Render date: 2024-12-26T00:43:43.564Z Has data issue: false hasContentIssue false
  • English
  • Français

A Procedure for Improving the Upper Bound for the Number of n-Ominoes

Published online by Cambridge University Press:  20 November 2018

D. A. Klarner  and
R. L. Rivest
D. A. Klarner
Affiliation:
Stanford University, Stanford, California
R. L. Rivest
Affiliation:
Stanford University, Stanford, California
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

We begin with some definitions and a formulation of the problem treated in subsequent sections. Also included in this section is a brief indication of some of the known results dealing with the n-omino enumeration problem. Some of what follows together with more details may be found in [3] or [4].

Type
Research Article
Information
Canadian Journal of Mathematics , Volume 25 , Issue 3 , June 1973 , pp. 585 - 602
Copyright
Copyright © Canadian Mathematical Society 1973

References

1. Eden, M., A two-dimensional growth process, Proceedings of the Fourth Berkeley Symposium on Mathematical Statistics and Probability, Vol. IV (Berkeley, California, 1961), pp. 223–239.Google Scholar
2. Hautus, M. L. J. and Klarner, D. A., The diagonal of a double power series, Duke Math. J. 88 (1971), 229–235.Google Scholar
3. Klarner, D. A., Cell growth problems, Can. J. Math. 19 (1967), 851–863.Google Scholar
4. Klarner, D. A., Methods for the general cell growth problem, Combinatorial Theory and its Applications (Balatonfüred, Hungary, 1969), 705–720.Google Scholar
5. Klarner, D. A., Some results concerning polyominoes, Fibonacci Quart. 3 (1965), 9–20.Google Scholar
6. Read, R. C., Contributions to the cell growth problem, Can. J. Math. 14 (1962), 1–20.Google Scholar
7. Uspensky, J. V., Theory of equations (McGraw-Hill, New York, 1948).Google Scholar