Hostname: page-component-7b7567c8c-fvjsw Total loading time: 0 Render date: 2026-11-15T00:45:22.110Z Has data issue: false hasContentIssue false

Covering Problem for Idempotent Latin Squares

Published online by Cambridge University Press:  20 November 2018

Katherine Heinrich*
Affiliation:
Department of Mathematics, Simon Fraser University, Burnaby B.C. VSA IS6
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

Let A = (a ij ) be an idempotent latin square of order n, n ≥ 3, in which a ii = i, 1 ≤ i ≤ nc. A set S ⊆ N = {1, 2, …, n} is a cover of A if (N × N)\{(i, i):i ∉ S} = {(i, j): i ∊ S, j ∊ N} ∪ {(j, i): i ∊ S, j ∊ N} ∪ {(i, j): a ij ∊ S}. A cover S is minimum for A if |S| < |T| for every cover T of A and we write c(A) = |S|. We denote by c(n) the maximum value of c(A) over all idempotent latin squares A of order n and in this paper show that (7n/10)-3.8 ≤ c (n) < n - n 1/3 + 1 for all n ≥ 15. The problem of determining c(n) was first raised by J. Schönheim.

Keywords

Information

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1983