On a Combinatorial Problem in Number Theory
Canadian mathematical bulletin, Tome 8 (1965) no. 4, pp. 477-490
Voir la notice de l'article provenant de la source Cambridge
Given an integer k ≤ 2 and a finite set M of rational integers. Let vi (i = 1, 2, ..., n) be m-dimensional (column-)vectors with all components from M and such that the kn sums 1.1 are all different. Then we shall say that {v1, v2, ..., vn} is a detecting set of vectors.
Lindström, Bernt. On a Combinatorial Problem in Number Theory. Canadian mathematical bulletin, Tome 8 (1965) no. 4, pp. 477-490. doi: 10.4153/CMB-1965-034-2
@article{10_4153_CMB_1965_034_2,
author = {Lindstr\"om, Bernt},
title = {On a {Combinatorial} {Problem} in {Number} {Theory}},
journal = {Canadian mathematical bulletin},
pages = {477--490},
year = {1965},
volume = {8},
number = {4},
doi = {10.4153/CMB-1965-034-2},
url = {http://geodesic.mathdoc.fr/articles/10.4153/CMB-1965-034-2/}
}
Cité par Sources :