Skip to main content
SpringerLink
Log in

Polyominoes and animals: Some recent results

  • Discrete Mathematics
  • Published:
Journal of Mathematical Chemistry Aims and scope Submit manuscript

Abstract

We give a survey of recent works relating algebraic languages and formal power series with the enumeration of polyominoes (and animals). More precisely, encoding these structures with words yield new exact results.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. E. Ahronotitz and M. Habib, CICC: Un logiciel de compression d'images par codes de contours, Rapport de l'Ecole de Mines, Saint-Etienne (1986)

  2. G.E. Andrews,q-series: their development and application in analysis, number theory, combinatories, physics, and computer algebra, AMS, Library of congress Cataloguing-in-Publication Data (1986).

  3. E. Barcucci, R. Pinzani and E. Rodella, Some properties of binary search networks, Research Report 1/90, Dipartimento di Sistemi e Informatica, Université de Florence (1990).

  4. R.J. Baxter,Exactly Solved Models in Statistical Mechanics, (Academic Press New York, 1982).

    Google Scholar 

  5. D. Beauquier and M. Nivat, Tiling with polyominoes, Report LITP 88-66, Université Paris VII (1988).

  6. D. Beauquier and M. Nivat, Tiling the plane with with one polyomino, Report LIPT 88-66, Université Paris VII (1989).

  7. E. Bender, Convexn-ominois, Discr. Math. 8 (1974) 219–226.

    Google Scholar 

  8. E. Bender, Asymptotic methods in enumeration, SIAM Rev. (1974)485–515.

  9. C. Berge, C.C. Chen, V. Chvatal and C.S. Seow, Combinatorial properties of polyominoes, Combinatoria 3 (1981) 217–224.

    Google Scholar 

  10. J. Berstel and C. Reutenauer,Les Séries Rationalles et Leurs Langages (Masson, Paris, 1984).

    Google Scholar 

  11. J. Bertrema and J.G. Penaud, Animaux et arbes guingois, Rapport LaBRI 90-60, Université de Bordeaux I.

  12. M. Bousquet-Mélou, Codage des polyominos convexes et équations pour lénumération selon l'aire, submitted.

  13. R. Cederberg, On the coding, processing, and display of binary images, Linköping Studies in Science and Technology, Dissertation No. 57, Linköping, Sweden (1980).

    Google Scholar 

  14. S. Chaiken, D.J. Kleitman, M. Saks, J. Shearer, Covering regions by rectangles, SIAM J. Allg. Discr. Meth. 2 (1981) 394–410.

    Google Scholar 

  15. J.H. Conway and J.C. Lagarias, Tiling with polyominoes and combinatorial group theory, J.C.T. A53 (1990) 183–208.

    Google Scholar 

  16. R. Cori, Un code pour les graphes planaires et ses applications, Astérisque, Soc. Math. France No. 27 (1975).

  17. R. Cori and B. Vauquelin, Planars maps are well labeled trees, Can. J. Math. 33 (1981) 1023–1042.

    Google Scholar 

  18. M.P. Delest, Generating functions for column-convex polyominoes, J.C.T. A48 (1988) 12–31.

    Google Scholar 

  19. M.P. Delest and S. Dulucq, Enumeration of directed column-convex animals with given perimeter and area, Report LaBRI 86-15, Université de Bordeaux I.

  20. M.P. Delest and J.M. Fedou, Exact formulas for fully company animals, Report LaBRI 89-06.

  21. M.P. Delest and J.M. Fedou, Enumeration of skew Ferrers diagrams, Discr. Math. in press.

  22. M.P. Delest and J.M. Fedou, Counting polyominoes using attribute grammars,Proc. Workshop on Attribute Grammars, ed. P. Deransart and M. Jourdan, Lecture Notes in Computer Science 461 (1990), pp. 46–60.

  23. M.P. Delest, D. Gouyou-Beauchamps B. Vauquelin, Enumeration of parallelograms polyominoes with given bond and site parameter, Graphs and Combinatorics 3 (1987) 325–339.

    Google Scholar 

  24. M.P. Delest G. Viennot, Algebraic languages and polyominoes enumeration, Theor. Comp. Sci. 34 (1984) 169–206.

    Google Scholar 

  25. D. Dhar, Equivalence of the two-dimensional directed animal problem to Baxter hard-square lattice-gas model, Phys. Rev. Lett. 49 (1982) 959–962.

    Google Scholar 

  26. D. Dhar, Exact solution of a directed-site animals enumeration in three dimensions, Phys. Rev. Lett. 59 (1983) 853–856.

    Google Scholar 

  27. D. Dhar, M.K. Phani M. Barma, Enumeration of directed site animals on two-dimensional lattices, J. Phys. A15 (1982) L279–284.

    Google Scholar 

  28. D. Foata, Aspects combinattoires due calcul desq-séries, Compte rendu du Séminaire d'Informatique Théorique LITP année 1980–1981, Université Paris VI/Paris VII, pp. 37–53.

  29. M. Gardner, Mathematical games, Sci. Amer. (Sept. 1958) 182–192; (Nov. 1958) 136–142.

  30. J. Goldman, Formal languages and enumeration, J. Comb. Theory A24 (1978) 318–338.

    Google Scholar 

  31. S. Golomb,Polyominoes, (Scribner, New York, 1965).

    Google Scholar 

  32. S. Golomb, Polyominoes while tile rectangles, J. Comb. Theory A51 (1989) 117–124.

    Google Scholar 

  33. D. Gouyou-Beauchamps and X.G. Viennot, Equivalence of the two-dimensional directed animal problem to a one-dimensional path problem, Adv. Appl. Math. 9 (1988) 334–357.

    Google Scholar 

  34. A.J. Guttmann, On the number of lattice animals embeddable in the square lattice, J. Phys. A15 (1982) 1987–1990.

    Google Scholar 

  35. A.J. Guttmann and I.G. Enting, The number of convex polygons on the square and honeycomb lattices, J. Phys. A21 (1988) 467–474.

    Google Scholar 

  36. V. Hakim and J.P. Nadal, Exact results for 2D directed lattice animals on a strip of finite width, J. Phys. A16 (1983) L213–218.

    Google Scholar 

  37. D.A. Klarner, Some results concerning polyominoes, Fibonacci Quart. 3 (1965) 9–20.

    Google Scholar 

  38. D.A. Klarner, My life among polyominoes, in:The Mathematical Gardner (Wadsworth, Belmont, CA, 1981), pp. 243–262.

    Google Scholar 

  39. D.A. Klarner and R.L. Rivest, Asymptotic bounds for the number of convexn-ominoes, Discr. Math. 8 (1974) 31–40.

    Google Scholar 

  40. D.E. Knuth, Semantics of context-free languages, Math. Sys. Th. 2(years??)127–145.

  41. K.Y. Lin and S.J. Chang, Rigorous results for the number of convex polygons on the square and honeycomb lattices, J. Phys. A21 (1988) 2653–2642.

    Google Scholar 

  42. J.P. Nadal, B. Derrida J. Vannimenus, Directed lattice animals in two dimensions: Numerical and exact results, J. de Phys. 43 (1982) 1561.

    Google Scholar 

  43. J.P. Nadal, B. Derrida and J. Vannimenus, Directed diffusion-controlled aggregation versus directed animals, Preprint (1983).

  44. G. Pólya, On the number of certain lattice polygons, J. Comb. Theory 6 (1969) 102–105.

    Google Scholar 

  45. J.G. Penaud, Animaux dirgés diagonalement convexes et arbres ternaires, Rapport LaBRI 90-62, Université de Bordeaux I.

  46. J. G. Penaud, Arbres et animaux, Université de Bordeaux I (May 1990).

  47. V. Privman and G. Forgacs, Exact solution of the partially directed compact lattice animal model, J. Phys. A20 (1987) L543–547.

    Google Scholar 

  48. V. Privman and N.M. Svrakič, Exact generating function for fully directed compact lattice animals, Phys. Rev. Lett. 60 (1988) 1107–1109.

    Google Scholar 

  49. M.P. Schützenberger, Certain elementary families of automata,Proc. Symp. on Mathematical Theory of Automata (Polytechnic Institute of Brooklyn, 1962), pp. 139–153.

  50. M.P. Schützenberger, Context-free languages and pushdown automata, Inf. Control 6 (1963) 246–264.

    Google Scholar 

  51. N.J. Sloane,A Handbook of Integer Sequences (Academic Press, New York, 1979).

    Google Scholar 

  52. X.G. Viennot, Problèmes combinatories posés par la physique statistique, Séminaire Bourbaki No. 626, 36éme année, in: Astérisque No. 121–122(1985)225–246.

  53. X.G. Viennot, Enumerative combinatorics and algebraic languages,Proc. FCT' 85, ed. L. Budach, Lecture Notes in Computer Science 199 (Springer, Berlin, 1985), pp. 450–464.

    Google Scholar 

  54. H.A.J. Wijshoff and J. van Leeuwen, Arbitrary versus periodic storage schemes and tessellations of the plane using one type of polyomino, Inf. Control 62 (1984) 1–25.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LaBRI, Département d'Informatique, U.F.R. de Mathématiques et Informatique, Université Bordeaux I, 351 Cours de la Libération, 33405, Talence, Cedez, France

    M. Delest

Authors
  1. M. Delest
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This work was partially by the “PRC de Mathématiques et Informatique”.

Laboratoire Bordelais de Recherche en Informatique, Unité Associée au Centre National de la Recherche Scientifique no. 1304.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Delest, M. Polyominoes and animals: Some recent results. J Math Chem 8, 3–18 (1991). https://doi.org/10.1007/BF01166920

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01166920

Keywords

Search

Navigation