Every large set of equidistant (0, +1, −1)-vectors forms a sunflower
Every large set of equidistant (0, +1, −1)-vectors forms a sunflower
复制标题
每个大的等距 (0, +1, −1) 向量集形成一朵向日葵
DOI:
--
复制
发表时间:
1981
期刊:
影响因子:
--
通讯作者:
P. Frankl
中科院分区:
文献类型:
--
作者:
M. Deza;P. Frankl
AbstractA theorem of Deza asserts that ifH1, ...,Hm ares-sets any pair of which intersects in exactlyd elements and ifm ≧s2 −s+2, then theHi form aΔ-system, i.e.
$$\left| {\bigcap\limits_{i = 1}^m {H_i } } \right| = d$$
. In other words, every large equidistant (0, 1)-code of constant weight is trivial. We give a (0, +1, −1) analogue of this theorem.