Wiki
Wiki

Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.

Updated


Source. Published p. 283, Theorem 10.3 (PDF).

Statement. Let pp be prime and 0≤i<p0\le i<p. If ∣A∩B∣≡i(modp)|A\cap B|\equiv i\pmod p for all A∈AA\in\mathcal A, B∈BB\in\mathcal B, then ∣A∣∣B∣≤2n|\mathcal A||\mathcal B|\le2^n if i=0i=0, and at most 2n−12^{n-1} if i≠0i\ne0.

Proof. For i=0i=0, the characteristic-vector spans over Fp\mathbb F_p are orthogonal, with dimensions summing to at most nn. Proposition 10.4 bounds their contained binary vectors by 2dim⁡V2^{\dim V} and 2dim⁡W2^{\dim W}, proving the first assertion.

For i≠0i\ne0, append one to the vectors on the first side and −i-i to those on the second. Their spans V,W⊆Fpn+1V,W\subseteq\mathbb F_p^{n+1} are orthogonal. Each last-coordinate functional is nonzero, and its specified nonzero level is an affine space of dimension one less than the span. Deleting the last coordinate is injective on that affine level and leaves the original binary vectors. Proposition 10.4, applied in Fpn\mathbb F_p^n to these affine images, gives

∣A∣∣B∣≤2dim⁡V−12dim⁡W−1≤2n−1.|\mathcal A||\mathcal B| \le2^{\dim V-1}2^{\dim W-1}\le2^{n-1}.

An empty family makes the conclusion immediate. □\square

The level-set argument is necessary for the factor four: for odd pp one must not simply say that a fixed last coordinate contains half of the entire vector space, as in the binary proof.

Dependencies. proposition_10_4.