Geodesic
Cell Growth Problems
Canadian journal of mathematics, Tome 19 (1967) no. 1, pp. 851-863

Voir la notice de l'article provenant de la source Cambridge University Press

The square lattice is the set of all points of the plane whose Cartesian coordinates are integers. A cell of the square lattice is a point-set consisting of the boundary and interior points of a unit square having its vertices at lattice points. An n-omino is a union of n cells which is connected and has no finite cut set.The set of all n-ominoes, Rn is an infinite set for each n; however, we are interested in the elements of two finite sets of equivalence classes, Sn and Tn , which are defined on the elements of Rn as follows: Two elements of Rn belong to the same equivalence class (i) in Sn , or (ii) in Tn , if one can be transformed into the other by (i) a translation or (ii) by a translation, rotation, and reflection of the plane. 
Klarner, David A. Cell Growth Problems. Canadian journal of mathematics, Tome 19 (1967) no. 1, pp. 851-863. doi: 10.4153/CJM-1967-080-4
@article{10_4153_CJM_1967_080_4,
     author = {Klarner, David A.},
     title = {Cell {Growth} {Problems}},
     journal = {Canadian journal of mathematics},
     pages = {851--863},
     year = {1967},
     volume = {19},
     number = {1},
     doi = {10.4153/CJM-1967-080-4},
     url = {http://geodesic.mathdoc.fr/articles/10.4153/CJM-1967-080-4/}
}
TY  - JOUR
AU  - Klarner, David A.
TI  - Cell Growth Problems
JO  - Canadian journal of mathematics
PY  - 1967
SP  - 851
EP  - 863
VL  - 19
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.4153/CJM-1967-080-4/
DO  - 10.4153/CJM-1967-080-4
ID  - 10_4153_CJM_1967_080_4
ER  - 
%0 Journal Article
%A Klarner, David A.
%T Cell Growth Problems
%J Canadian journal of mathematics
%D 1967
%P 851-863
%V 19
%N 1
%U http://geodesic.mathdoc.fr/articles/10.4153/CJM-1967-080-4/
%R 10.4153/CJM-1967-080-4
%F 10_4153_CJM_1967_080_4

[1] 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] 2. Golomb, S. W., Checkerboards and polyominoes, Amer. Math. Monthly, 61 (1954), 275–282. Google Scholar

[3] 3. Harary, F., Unsolved problems in the enumeration of graphs, (Magyar Tud. Akad. Mat. Kutato Int Kozl.) Publ. Math. Inst. Hungar. Acad. Sci., 5 (1960), 63–95. Google Scholar

[4] 4. Harary, F., “Combinatorial problems in graphical enumeration,” Chap. 6, Applied combinatorial analysis, ed. by Beckenbach, F. (New York, 1964), pp. 185–217. Google Scholar

[5] 5. Klarner, D. A., Some results concerning polyominoes, Fibonacci Quarterly 8 (1965), 9–20. Google Scholar

[6] 6. Klarner, D. A., Combinatorial problems involving the Fredholm integral equation, to appear. Google Scholar

[7] 7. Pólya, G. and Szego, G., Aufgaben und Lehrsätze aus der Analysis, Vol. 1 (Berlin, 1925). Google Scholar

[8] 8. Read, R. C., Contributions to the cell growth problem, Can. J. Math., 14 (1962), 1–20. Google Scholar

[9] 9. Riesz, F. and Sz-Nagy, B., Functional analysis (New York, 1955). Google Scholar

[10] 10. Titchmarsh, E. C., The theory of functions, 2nd ed. (Oxford, 1939). Google Scholar

Cité par Sources :