Group Partition, Factorization and the Vector Covering Problem
Canadian mathematical bulletin, Tome 15 (1972) no. 2, pp. 207-214

Voir la notice de l'article provenant de la source Cambridge University Press

The covering problem. Let S i(i = 1, 2,...,n) be given sets containing mi elements respectively and let 1 be their cartesian product. The elements of S (n) will be called vectors. The vector (x1 x2,..., xn) covers (y1 y2,..., yn) if xi =yi for at least n—1 values of i. A subset M of S (n) is said to be a covering (perfect covering) of S (n) if each member of S (n) is covered by at least (exactly) one member of M. A covering M is said to be linear if the sets Si are groups Gi and M is a subgroup of G (n) = S (n) Denote by σ(n; m1 m2,..., mn) the value of min |M| when M runs through all coverings of S(n) and by σ(n; m1 m2,..., mn) the value of min |M| when the sets Si are given groups Gi and M runs through all linear coverings of G (n).
Herzog, M.; Schönheim, J. Group Partition, Factorization and the Vector Covering Problem. Canadian mathematical bulletin, Tome 15 (1972) no. 2, pp. 207-214. doi: 10.4153/CMB-1972-038-x
@article{10_4153_CMB_1972_038_x,
     author = {Herzog, M. and Sch\"onheim, J.},
     title = {Group {Partition,} {Factorization} and the {Vector} {Covering} {Problem}},
     journal = {Canadian mathematical bulletin},
     pages = {207--214},
     year = {1972},
     volume = {15},
     number = {2},
     doi = {10.4153/CMB-1972-038-x},
     url = {http://geodesic.mathdoc.fr/articles/10.4153/CMB-1972-038-x/}
}
TY  - JOUR
AU  - Herzog, M.
AU  - Schönheim, J.
TI  - Group Partition, Factorization and the Vector Covering Problem
JO  - Canadian mathematical bulletin
PY  - 1972
SP  - 207
EP  - 214
VL  - 15
IS  - 2
UR  - http://geodesic.mathdoc.fr/articles/10.4153/CMB-1972-038-x/
DO  - 10.4153/CMB-1972-038-x
ID  - 10_4153_CMB_1972_038_x
ER  - 
%0 Journal Article
%A Herzog, M.
%A Schönheim, J.
%T Group Partition, Factorization and the Vector Covering Problem
%J Canadian mathematical bulletin
%D 1972
%P 207-214
%V 15
%N 2
%U http://geodesic.mathdoc.fr/articles/10.4153/CMB-1972-038-x/
%R 10.4153/CMB-1972-038-x
%F 10_4153_CMB_1972_038_x

[1] 1. Taussky, O. and Todd, Y., Covering theorems for groups, Ann. Polon. Math. 21 (1949), 303-308. Google Scholar

[2] 2. Kalbfleisch, J. G. and Stanton, R. G., A combinatorial problem in matching, J. Londo. Math. Soc. 44 (1969), 60-64. Google Scholar

[3] 3. Zaremba, S. K., Covering problems concerning Abelian Groups, J. Londo. Math. Soc. 27 (1952), 242-246. Google Scholar

[4] 4. Losey, G., Note on a theorem of Zaremba, J. Comb. Theory, 6 (1969), 208-209. Google Scholar

[5] 5. Zaremba, S. K., A covering theorem for Abelian groups, J. Londo. Math. Soc. 26 (1950), 71-72. Google Scholar

[6] 6. Sands, A. D., Factorizations of cyclic groups, Proc. Coll. on Abelian Groups, Akademiai Kiado Budapest (1964), 139-146. Google Scholar

[7] 7. Baer, R., PartiMonen endlicher Gruppen, Math. Z. 75 (1961), 337. Google Scholar

[8] 8. Lindstrom, B., On group and nongroup perfect codes in q symbols, Math. Scand. 25 (1969), 145-158. Google Scholar

Cité par Sources :