2010
DOI: 10.1016/j.jcta.2009.03.019
|View full text |Cite
|
Sign up to set email alerts
|

Divisors of the number of Latin rectangles

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 (1, 2, . . . ,k) T . Let R k,n be the number of reduced k × n 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 m and m! divides R k,n when m < k n. We establish a recurrence which determines the congruence class of R k,n (mod t) for a range of different t. We use this to show that R k,n ≡ ((−1) k−1 (k … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
21
0

Year Published

2012
2012
2015
2015

Publication Types

Select...
6

Relationship

4
2

Authors

Journals

citations
Cited by 17 publications
(21 citation statements)
references
References 31 publications
0
21
0
Order By: Relevance
“…We begin by specializing the proof template in [23] to be applicable to Latin squares of a given sign. Let C be the set of all reduced Latin squares of order n. Consider a group G of isotopisms that acts on C. Suppose that G acts on a set A where {L ∈ C : | Atp(L) ∩ G| > 1} ⊆ A ⊆ C. Unless otherwise specified, we will assume that…”
Section: §1 Introduction and Basic Propertiesmentioning
confidence: 99%
“…We begin by specializing the proof template in [23] to be applicable to Latin squares of a given sign. Let C be the set of all reduced Latin squares of order n. Consider a group G of isotopisms that acts on C. Suppose that G acts on a set A where {L ∈ C : | Atp(L) ∩ G| > 1} ⊆ A ⊆ C. Unless otherwise specified, we will assume that…”
Section: §1 Introduction and Basic Propertiesmentioning
confidence: 99%
“…divides R n . Theorem 2.2 implies that R n ≡ 0 (mod p) for all primes p m. In [2,24] we show that R p ≡ 1 (mod p) for prime p. The following theorem gives the value of R n (mod p) for primes p in the range m < p < n. Theorem 2.3. Let p be a prime such that n k p + 1.…”
Section: A Congruence For the Number Of Latin Rectanglesmentioning
confidence: 91%
“…We know that R n ≡ 0 (mod p) when n 2p by Theorem 2.2 and that R p ≡ 1 (mod p) by [2,24]. We now also know the value of R n (mod p) when p < n < 2p by Theorem 2.3.…”
Section: A Congruence For the Number Of Latin Rectanglesmentioning
confidence: 93%
See 2 more Smart Citations