The number of Latin rectangles
Combinatorics
2007-05-23 v1
Abstract
We show how to generate an expression for the number of k-line Latin rectangles for any k. The computational complexity of the resulting expression, as measured by the number of additions and multiplications required to evaluate it, is on the order of n^(2^(k-1)). These expressions generalize Ryser's formula for derangements.
Cite
@article{arxiv.math/0703896,
title = {The number of Latin rectangles},
author = {Peter G. Doyle},
journal= {arXiv preprint arXiv:math/0703896},
year = {2007}
}
Comments
Version dated circa 1980; GNU FDL