The Number of Latin Rectangles [PDF]
Library Home || Full Table of Contents || Suggest a Link || Library Help
|A paper that shows 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. PostScript and source file are available from Doyle's site.|
|Math Topics:||Discrete Math, Combinatorics|
© 1994- The Math Forum at NCTM. All rights reserved.