English

Intersection theorems for $(-1,0,1)$-vectors

Combinatorics 2020-04-21 v1 Discrete Mathematics

Abstract

In this paper, we investigate Erd\H os--Ko--Rado type theorems for families of vectors from {0,±1}n\{0,\pm 1\}^n with fixed numbers of +1+1's and 1-1's. Scalar product plays the role of intersection size. In particular, we sharpen our earlier result on the largest size of a family of such vectors that avoids the smallest possible scalar product. We also obtain an exact result for the largest size of a family with no negative scalar products.

Keywords

Cite

@article{arxiv.2004.08721,
  title  = {Intersection theorems for $(-1,0,1)$-vectors},
  author = {Peter Frankl and Andrey Kupavskii},
  journal= {arXiv preprint arXiv:2004.08721},
  year   = {2020}
}
R2 v1 2026-06-23T14:56:31.530Z