Skip to content
New issue

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

Littlewood-Offord problem #29

Open
YaelDillies opened this issue Jan 22, 2025 · 0 comments
Open

Littlewood-Offord problem #29

YaelDillies opened this issue Jan 22, 2025 · 0 comments

Comments

@YaelDillies
Copy link
Owner

Let $x_1, \dots, x_n$ be vectors of norm at least $1$ a normed space. For $A \subseteq [n]$, set $x_A =
\sum_{i \in A} x_i$. Let $\McA \subseteq 2^{[n]}$ be such that
$$\forall A, B \in \McA, ||x_A - x_B|| < 1$$
Then $|\McA| \le {n \choose \lfloor\frac n2\rfloor}$.

This is Theorem 1.12 in the lecture notes and there is a start over at #21.

@YaelDillies YaelDillies moved this to Unclaimed in PlainCombi Jan 22, 2025
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
Status: Unclaimed
Development

No branches or pull requests

1 participant