Intersection theorems for (-1,0,1)-vectors
classification
🧮 math.CO
cs.DM
keywords
scalarsizevectorsfamilyintersectionlargestproductresult
read the original abstract
In this paper, we investigate Erd\H os--Ko--Rado type theorems for families of vectors from $\{0,\pm 1\}^n$ with fixed numbers of $+1$'s and $-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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.