Aurelio de Gennaro
Published 2007-11-04Version 1
Until now the problem counting Latin rectangles m x n has been solved with an explicit formula for m = 2, 3 and 4 only. In the present paper an explicit formula is provided for the calculation of the number of Latin rectangles for any order m. The results attained up to now become particular cases of this new formula. Furthermore, putting m = n, the number of Latin squares of order n can also be obtained in an explicit form.
An explicit formula for the number of permutations with a given number of alternating runs
On the number of partitions of $n$ whose product of the summands is at most $n$
An explicit formula for Bell numbers in terms of Stirling numbers and hypergeometric functions
![QR code for arXiv:0711.0527 [math.CO]](http://oss.arxitics.com/images/favicon.svg)