Divisors of the number of Latin rectangles |
| |
Authors: | Douglas S. Stones |
| |
Affiliation: | School of Mathematical Sciences, Monash University, Vic 3800, Australia |
| |
Abstract: | A k×n Latin rectangle on the symbols {1,2,…,n} is called reduced if the first row is (1,2,…,n) and the first column is T(1,2,…,k). Let Rk,n be the number of reduced k×n Latin rectangles and m=⌊n/2⌋. We prove several results giving divisors of Rk,n. For example, (k−1)! divides Rk,n when k?m and m! divides Rk,n when m<k?n. We establish a recurrence which determines the congruence class of for a range of different t. We use this to show that Rk,n≡((−1)k−1(k−1)!)n−1. In particular, this means that if n is prime, then Rk,n≡1 for 1?k?n and if n is composite then if and only if k is larger than the greatest prime divisor of n. |
| |
Keywords: | Latin rectangles Latin squares |
本文献已被 ScienceDirect 等数据库收录! |
|