The Number of Latin Rectangles [PDF]
Library Home 
Full Table of Contents 
Library Help
http://math.dartmouth.edu/~doyle/docs/latin/latin.pdf  


Peter Doyle  
A paper that shows how to generate an expression for the number of kline 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^k1). These expressions generalize Ryser's formula for derangements. PostScript and source file are available from Doyle's site.  


Levels:  College, Research 
Languages:  English 
Resource Types:  Articles 
Math Topics:  Discrete Math, Combinatorics 
[Privacy Policy] [Terms of Use]
© 1994 The Math Forum at NCTM. All rights reserved.
http://mathforum.org/