Hostname: page-component-7bb8b95d7b-l4ctd Total loading time: 0 Render date: 2024-09-27T23:39:11.286Z Has data issue: false hasContentIssue false
  • English
  • Français

The Number of Very Reduced 4 × n Latin Rectangles

Published online by Cambridge University Press:  20 November 2018

W. O. J. Moser
W. O. J. Moser*
Affiliation:
McGill University, Montreal
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.

Two permutations (displayed in the two rows)

of the integers 1, 2, … , n are called discordant if ai ≠ bi, i = 1, 2, …, n. Let v(4, n), n ⩾ 4, be the number of permutations discordant with the three Permutations

Type
Research Article
Information
Canadian Journal of Mathematics , Volume 19 , 1967 , pp. 1011 - 1017
Copyright
Copyright © Canadian Mathematical Society 1967

References

1. Erdös, P. and Kaplansky, I., The asymptotic number of Latin rectangles, Amer. J. Math., 68 (1946), 230–236.Google Scholar
2. Kaplansky, I., Solution to the “problème des ménages”, Bull. Amer. Math. Soc., 49 (1943), 784–785.Google Scholar
3. Kaplansky, I., Symbolic solution of certain problems in permutations, Bull. Amer. Math. Soc., 50 (1944), 906–914.Google Scholar
4. Riordan, J., An introduction to combinatorial analysis (New York, 1958).Google Scholar
5. Yamamoto, K., On the asymptotic number of Latin rectangles, Japan. J. Math., 21 (1951), 113–119.Google Scholar
6. Yamamoto, K., Structure polynomial of Latin rectangles and its application to a combinatorial problem, Mem. Fac. Sci. Kyusyu Univ., Ser. A, 10 (1956), 1–13.Google Scholar