Skip to main content
Springer Nature Link
Log in

Enumeration of parallelogram polyominoes with given bond and site perimeter

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

We give the generating function for parallelogram polyominoes according to the bond perimeter and the site perimeter. In this last case, we give an asymptotic evaluation for their number. According to the two parameters an exact formula for their number is found which gives some numbers closed to the Narayana's numbers.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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. Delest, M.: Generating functions for column-convex polyominoes, Bordeaux Report 8503. J. Comb. Theory (A) (to appear)

  2. Delest, M., Viennot, G.: Algebraic languages and polyominoes enumeration. Theor. Comput. Sci.34, 169–206 (1984)

    Google Scholar 

  3. Dhar, D., Phani, M.K., Barma, M.: Enumeration of directed site animals on two-dimensional lattices. J. Phys. A: Math. Gen.15, L279-L284 (1982)

    Google Scholar 

  4. Flajolet, P.: Mathematical Analysis of algorithms and data Structures. In: A Graduate Course in Computational Theory. Computer Science Press 1985

  5. Gessel, I., Viennot, G.: Binomial determinants, Paths and Hook lengths formulae. Advances in Math.,36, 300–321 (1986)

    Google Scholar 

  6. Golomb, S.: Polyominoes. New York: Scribner 1965

    Google Scholar 

  7. Gouyou-Beauchamps, D.: Deux propriétés du langage de Lukasiewicz, RAIRO, dec.3, 13–24 (1975)

    Google Scholar 

  8. Gouyou-Beauchamps, D., Viennot, G.: Equivalence of the two-dimensional directed animal problem. Appl. Maths. (to appear)

  9. Klarner, D.: My life among the polyominoes. In: The Mathematical Gardner, pp. 243–262. Belmont CA: Wadsworth 1981

    Google Scholar 

  10. Kreweras, G.: Joint distributions of three descriptive parameters of bridges. In: Colloque de Combinatoire énumérative. Lecture Notes in Mathematics 1234, pp. 177–191. Montréal: UQAM 1985

    Google Scholar 

  11. Narayana, T.V.: A partial order and its applications to probability Theory. Sankhya,21, 91–98 (1959)

    Google Scholar 

  12. Polya, G.: On the number of certain lattice polygons. J. Comb. Theoory6, 102–105 (1969)

    Google Scholar 

  13. Read, R.C.: Contributions to the cell growth problem. Canad. J. Math.14, 1–20 (1962)

    Google Scholar 

  14. Viennot, G.: Problèmes combinatoires posés par la Physique statistique. Séminaire Bourbaki, 626, Feb. 1984. In: Astérisque, pp. 121–122, 225–246. Soc. Math. France 1985

  15. Viennot, G.: Enumerative combinatorics and algebraic languages. In: Proc. FCT' 85. Lecture Notes in Computer Science 199, edited by L. Budach, pp. 450–464. Berlin-Heidelberg-New York: Springer 1985

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Université de Bordeaux I, U.E.R. de Mathématiques et D'Informatique Unité associée au C.N.R.S. n°226, 351, Cours de La Libération, 33405, Talence Cedex, France

    M. P. Delest, D. Gouyou-Beauchamps & B. Vauquelin

Authors
  1. M. P. Delest
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. D. Gouyou-Beauchamps
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. B. Vauquelin
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Delest, M.P., Gouyou-Beauchamps, D. & Vauquelin, B. Enumeration of parallelogram polyominoes with given bond and site perimeter. Graphs and Combinatorics 3, 325–339 (1987). https://doi.org/10.1007/BF01788555

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords