Asymptotic enumeration of Latin rectangles
Journal of Combinatorial Theory Series B
Enumeration formulas for latin and frequency squares
Discrete Mathematics
A formula for the number of Latin squares
Discrete Mathematics
Combinatorial Enumeration
Estimating the number of latin rectangles by the fast simulation method
Cybernetics and Systems Analysis
Compound orthomorphisms of the cyclic group
Finite Fields and Their Applications
Formulae for the Alon-Tarsi Conjecture
SIAM Journal on Discrete Mathematics
Hi-index | 0.00 |
A kxn Latin rectangle on the symbols {1,2,...,n} is called reduced if the first row is (1,2,...,n) and the first column is (1,2,...,k)^T. Let R"k","n be the number of reduced kxn Latin rectangles and m=@?n/2@?. We prove several results giving divisors of R"k","n. For example, (k-1)! divides R"k","n when k=