Let Lmkl ⊂ Rm + k + l be the set of vectors which have m of entries − 1, k of entries 0, and l of entries 1. In this paper, we investigate the largest subset of Lmkl whose diameter is smaller than that of Lmkl. The largest subsets for m = 1, l = 2, and any k will be classified. From this result, we can classify the largest 4-distance sets containing the Euclidean representation of the Johnson scheme J(9, 4). This was an open problem in Bannai, Sato, and Shigezumi (2012).
@article{935, title = {On the largest subsets avoiding the diameter of (0, $\pm$1)-vectors}, journal = {ARS MATHEMATICA CONTEMPORANEA}, volume = {12}, year = {2016}, doi = {10.26493/1855-3974.935.4e0}, language = {EN}, url = {http://dml.mathdoc.fr/item/935} }
Adachi, Saori; Nozaki, Hiroshi. On the largest subsets avoiding the diameter of (0, ±1)-vectors. ARS MATHEMATICA CONTEMPORANEA, Tome 12 (2016) . doi : 10.26493/1855-3974.935.4e0. http://gdmltest.u-ga.fr/item/935/