Voir la notice de l'article provenant de la source Cambridge University Press
Moser, W. O. J. The Number of Very Reduced 4 × n Latin Rectangles. Canadian journal of mathematics, Tome 19 (1967) no. 1, pp. 1011-1017. doi: 10.4153/CJM-1967-092-5
@article{10_4153_CJM_1967_092_5,
author = {Moser, W. O. J.},
title = {The {Number} of {Very} {Reduced} 4 {\texttimes} n {Latin} {Rectangles}},
journal = {Canadian journal of mathematics},
pages = {1011--1017},
year = {1967},
volume = {19},
number = {1},
doi = {10.4153/CJM-1967-092-5},
url = {http://geodesic.mathdoc.fr/articles/10.4153/CJM-1967-092-5/}
}
[1] 1. Erdös, P. and Kaplansky, I., The asymptotic number of Latin rectangles, Amer. J. Math., 68 (1946), 230–236. Google Scholar
[2] 2. Kaplansky, I., Solution to the “problème des ménages”, Bull. Amer. Math. Soc., 49 (1943), 784–785. Google Scholar
[3] 3. Kaplansky, I., Symbolic solution of certain problems in permutations, Bull. Amer. Math. Soc., 50 (1944), 906–914. Google Scholar
[4] 4. Riordan, J., An introduction to combinatorial analysis (New York, 1958). Google Scholar
[5] 5. Yamamoto, K., On the asymptotic number of Latin rectangles, Japan. J. Math., 21 (1951), 113–119. Google Scholar
[6] 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
Cité par Sources :