Skip to main content

Counting three-line Latin rectangles

Part of the Lecture Notes in Mathematics book series (LNM,volume 1234)

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   44.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   59.95
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. K. B. Athreya, C. R. Pranesachar, and N. M. Singhi, On the number of Latin rectangles and chromatic polynomials of L(K r,s ), Europ. J. Combinatorics 1 (1980), 9–17.

    CrossRef  MathSciNet  MATH  Google Scholar 

  2. K. P. Bogart and J. Q. Longyear, Counting 3 by n Latin rectangles, Proc. Amer. Math. Soc. 54 (1976), 463–467.

    MathSciNet  MATH  Google Scholar 

  3. D. Foata, A combinatorial proof of the Mehler formula, J. Combinatorial Theory, Ser. A 24 (1978), 367–376.

    CrossRef  MathSciNet  MATH  Google Scholar 

  4. D. Foata and J. Labelle, Modèles combinatoires pour les polynômes de Meixner, Europ. J. Combinatorics 4 (1983), 305–311.

    CrossRef  MathSciNet  MATH  Google Scholar 

  5. D. Foata and P. Leroux, Combinatoire et fonction génératrice, Proc. Amer. Math. Soc. 87 (1983), 47–53.

    MathSciNet  MATH  Google Scholar 

  6. D. Foata and V. Strehl, Combinatorics of Laguerre polynomials, in Enumeration and Design, ed. D. M. Jackson and S. A. Vanstone, Academic Press, 1984, pp. 123–140.

    Google Scholar 

  7. I. P. Goulden and D. M. Jackson, Combinatorial Enumeration, Wiley, 1983.

    Google Scholar 

  8. S. M. Jacob, The enumeration of the Latin rectangle of depth three by means of a formula of reduction, with other theorems relating to non-clashing substitutions and Latin squares, Proc. London Math. Soc. 31 (1930), 329–354.

    CrossRef  MathSciNet  MATH  Google Scholar 

  9. S. M. Kerewala, The enumeration of the Latin rectangle of depth three by means of difference equations, Bull. Calcutta Math. Soc. 33 (1941), 119–127.

    MathSciNet  Google Scholar 

  10. C. R. Pranesachar, Enumeration of Latin rectangles via SDR's, in Combinatorics and Graph Theory, ed. S. B. Rao, Lecture Notes in Mathematics, vol. 885, Springer-Verlag, 1981, pp. 380–390.

    Google Scholar 

  11. J. Riordan, Three-line Latin rectangles, Amer. Math. Monthly 51 (1944), 450–452.

    CrossRef  MathSciNet  MATH  Google Scholar 

  12. J. Riordan, Three-line Latin rectangles–II, Amer. Math. Monthly 53 (1946), 18–20.

    CrossRef  MathSciNet  MATH  Google Scholar 

  13. J. Riordan, An Introduction to Combinatorial Analysis, Wiley, 1958.

    Google Scholar 

  14. G.-C. Rota, The number of partitions of a set, Amer. Math. Monthly 71 (1964), 498–504.

    CrossRef  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 1986 Springer-Verlag

About this paper

Cite this paper

Gessel, I.M. (1986). Counting three-line Latin rectangles. In: Labelle, G., Leroux, P. (eds) Combinatoire énumérative. Lecture Notes in Mathematics, vol 1234. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0072512

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-17207-9

  • Online ISBN: 978-3-540-47402-9

  • eBook Packages: Springer Book Archive