Mathematics – Combinatorics
Scientific paper
2007-03-29
Mathematics
Combinatorics
Version dated circa 1980; GNU FDL
Scientific paper
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.
No associations
LandOfFree
The number of Latin rectangles does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with The number of Latin rectangles, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The number of Latin rectangles will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-711284