Covering Problem for Idempotent Latin Squares
Canadian mathematical bulletin, Tome 26 (1983) no. 2, pp. 144-148
Voir la notice de l'article provenant de la source Cambridge
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.
Heinrich, Katherine. Covering Problem for Idempotent Latin Squares. Canadian mathematical bulletin, Tome 26 (1983) no. 2, pp. 144-148. doi: 10.4153/CMB-1983-023-7
@article{10_4153_CMB_1983_023_7,
author = {Heinrich, Katherine},
title = {Covering {Problem} for {Idempotent} {Latin} {Squares}},
journal = {Canadian mathematical bulletin},
pages = {144--148},
year = {1983},
volume = {26},
number = {2},
doi = {10.4153/CMB-1983-023-7},
url = {http://geodesic.mathdoc.fr/articles/10.4153/CMB-1983-023-7/}
}
Cité par Sources :