We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Define $$A \hat + B = {a + b \mid a \in A, b \in B, a \ne b}$$
For $A$ an interval in $\mathbb Z$, $|A \hat + A| = 2|A| - 3$. The Erdős-Heilbronn conjecture says this is best possible.
Let $A, B$ be sets in $\mathbb F_p$ such that $1 \le |A| < |B|$ and $|A| + |B| \le p + 2$. Then $$|A \hat + B| \ge |A| + |B| - 2$$
This is Theorem 2.7 in the lecture notes.
The text was updated successfully, but these errors were encountered:
No branches or pull requests
Define
$$A \hat + B = {a + b \mid a \in A, b \in B, a \ne b}$$
For$A$ an interval in $\mathbb Z$ , $|A \hat + A| = 2|A| - 3$ . The Erdős-Heilbronn conjecture says this is best possible.
Let$A, B$ be sets in $\mathbb F_p$ such that $1 \le |A| < |B|$ and $|A| + |B| \le p + 2$ . Then
$$|A \hat + B| \ge |A| + |B| - 2$$
This is Theorem 2.7 in the lecture notes.
The text was updated successfully, but these errors were encountered: