On Computing the Number of Latin Rectangles
Lists
Only you see this
Abstract
Doyle (circa 1980) found a formula for the number of $$k \times n$$ k × n Latin rectangles $$L_{k,n}$$ L k , n . This formula remained dormant until it was recently used for counting $$k \times n$$ k × n Latin rectangles, where $$k \in \{4,5,6\}$$ k ∈ { 4 , 5 , 6 } . We give a formal proof of Doyle’s formula for arbitrary k. We also improve a previous implementation of this formula, which we use to find $$L_{k,n}$$ L k , n when $$k=4$$ k = 4 and $$n \le 150$$ n ≤ 150 , when $$k=5$$ k = 5 and $$n \le 40$$ n ≤ 40 and when $$k=6$$ k = 6 and $$n \le 15$$ n ≤ 15 . Motivated by computational data for $$3 \le k \le 6$$ 3 ≤ k ≤ 6 , some research problems and conjectures about the divisors of $$L_{k,n}$$ L k , n are presented.
BibTeX
@article{stones2016computing,
author = {Rebecca J. Stones and Sheng Lin and Xiaoguang Liu and Gang Wang},
title = {{On Computing the Number of Latin Rectangles}},
journal = {Graphs Comb.},
year = {2016},
doi = {10.1007/s00373-015-1643-1},
}