# On Computing the Number of Latin Rectangles

@article{Stones2016OnCT,
title={On Computing the Number of Latin Rectangles},
author={Rebecca J. Stones and Sheng Lin and X. Liu and G. Wang},
journal={Graphs and Combinatorics},
year={2016},
volume={32},
pages={1187-1202}
}
• Published 1 May 2016
• Mathematics
• Graphs and Combinatorics
Doyle (circa 1980) found a formula for the number of $$k \times n$$k×n Latin rectangles $$L_{k,n}$$Lk,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}$$Lk,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…
4 Citations

### Enumerating Partial Latin Rectangles

• Mathematics
Electron. J. Comb.
• 2020
It is proved that the size of the set of partial Latin rectangles on symbols with non-empty cells is a symmetric polynomial of degree 3m, and the leading terms are determined using inclusion-exclusion.

### Counting and enumerating partial Latin rectangles by means of computer algebra systems and CSP solvers

• Mathematics
• 2018
This paper provides an in‐depth analysis of how computer algebra systems and CSP solvers can be used to deal with the problem of enumerating and distributing the set of r×s partial Latin rectangles

### Latin Squares and Their Applications to Cryptography

A latin square of order-n is an n × n array over a set of n symbols such that every symbol appears exactly once in each row and exactly once in each column. Latin squares encode features of algebraic

### Comments on "Discrete Groups, Expanding Graphs and Invariant Measures", by Alexander Lubotzky

This document is a collection of comments that I wrote down while reading the first four chapters of the book "Discrete Groups, Expanding Graphs and Invariant Measures" by Alexander Lubotzky. Most of