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

04/18/2020
by   Peter Frankl, et al.
0

In this paper, we investigate Erdős–Ko–Rado type theorems for families of vectors from {0,± 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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/30/2020

Intersection theorems for triangles

Given a family of sets on the plane, we say that the family is intersect...
research
07/01/2020

Density of diagonalizable matrices in sets of structured matrices defined from indefinite scalar products

For an (indefinite) scalar product [x,y]_B = x^HBy for B= ± B^H ∈ Gl_n(ℂ...
research
01/11/2022

Perfect matchings in down-sets

In this paper, we show that, given two down-sets (simplicial complexes) ...
research
10/01/2018

Degree versions of theorems on intersecting families via stability

The matching number of a family of subsets of an n-element set is the ma...
research
06/09/2021

Uniform intersecting families with large covering number

A family ℱ has covering number τ if the size of the smallest set interse...
research
10/05/2021

On the Properties of Error Patterns in the Constant Lee Weight Channel

The problem of scalar multiplication applied to vectors is considered in...
research
07/31/2018

Expectation of the Largest Betting Size in Labouchère System

For Labouchère system with winning probability p at each coup, we prove ...

Please sign up or login with your details

Forgot password? Click here to reset