# The maximal size of intersection of two sets

Let $$S=\{1,2,\cdots,2n\}$$, and $$S_i \subseteq S(i=1,2,\cdots,n+1)$$ be $$n+1$$ subsets, each of which contains half of the $$2n$$ elements, namely $$|S_i|=n$$. Consider the following expression: $$M=\max_{1\le i

1. When $$n$$ is even, it seems that $$M\ge n/2$$ for any choice of $$S_i$$. I think it is a really interesting phenomenon, but how does one give a proof of this.
2. Also by experiment, I find that$$\{(i,j):1\le i is $$\Omega(n)$$, not only one pair.

3. This question can be generalized to the following one: Let $$S=\{1,2,\cdots,n\}$$, and $$S_i \subseteq S$$ be $$m$$ subsets of $$S$$, each of which contains exactly $$k$$ elements. Can the maximal size of $$|S_i \cap S_j|(1\le i be bounded from below?

4. This question can be changed to a real version. Consider $$x_i \in [0,1]^n$$ be $$m$$ vectors, each of which has a fixed norm: $$\| {x_i}\|_2=k$$. Can the maximal inner product of $$x_i \cdot x_j(1\le i be bounded from below?

Maybe the third and fourth question are hard, but if they can be solved, I think the results will be very useful. Also, the correctness of the first two questions have been checked for a few instances.

Here is an answer to the first point and shows how you can also do the third point.

Let $$\displaystyle \bigcup_{i=1}^{n+1} S_i=\{b_{1},b_{2},\ldots, b_{m}\}$$. We consider the following table with rows indexed by the sets $$S_1,S_2,\ldots, S_{n+1}$$ and columns indexed by the elements $$b_1,b_2,\ldots, b_m$$. We put a $$1$$ in the cell $$(i,j)$$ with $$1\leq i\leq k$$ and $$1\leq j\leq m$$ if $$b_j$$ is an element of the set $$S_i$$. Let $$x_i$$ the number of $$1$$'s in the column $$i$$, or equivalently it is the number of sets in which the element $$b_i$$ appears with $$1\leq i\leq m$$.

Now we have that $$S=\displaystyle \sum_{i=1}^{m} x_i$$ is equal to the sum of the numbers in the whole table, and doing the sum by rows we obtain that $$\displaystyle \sum_{i=1}^{m} x_i=\sum_{i=1}^{n+1} |S_i|=n(n+1)$$.

Let us look further at $$\displaystyle \sum_{1\leq i. This is equal to the number of pairs of $$1$$'s who are in the same column. But this is equivalent in our notation to the fact $$\displaystyle \sum_{1\leq i.

Now just use the convexity of the function $$\binom{x}{2}$$ to get that $$\sum_{i=1}^{m} \dbinom{x_i}{2}\geq m \dbinom{\frac{n(n+1)}{m}}{2}=\cfrac{(n(n+1)-m)n(n+1)}{2m}$$.

Since there are $$\dbinom{n+1}{2}$$ intersection the maximum size of the intersection is at least $$\cfrac{n(n+1)-m}{m}$$. Finally $$m\leq 2n$$ and you get the desired size almost namely $$\cfrac{n-1}{2}$$.

• Thank you very much. The first and third question have been solved using your sulution. Also, it can be used to solve question 2. Let $x$ be the number of pairs $(i,j)$ such that $|S_i \cap S_j|\ge (n-1)/2$, then $xn+\left(\binom{n+1}{2}-x\right)\frac {n-3} 2 \ge \frac{{{n^2}(n - 1)(n + 1)}}{{4n}}$. Solving $x$ leads to $x \geqslant \frac{{n(n + 1)}}{{n + 3}}$, namely $x=\Omega(n)$. – zbh2047 Nov 10 '18 at 2:03

The Welch lower bound (applicable to arbitrary complex vectors, as opposed to the Sidelnikov lower bounds applicable only to vectors with entries in the complex roots of unity, which are somewhat tighter) states that for any integer $$f\geq 1,$$ we have
$$\max_{1\leq i
This can be optimized over $$f$$ and generally gives the best lower bound (for roughly equal norm vectors) when $$m\approx n^{f}.$$ For your specific case $$\max_{1\leq i