Page not found
This question was removed from MathOverflow for reasons of moderation. Please refer to the help center for possible explanations why a question might be removed.
Here are some similar questions that might be relevant:
- What is the shortest route to Roth's theorem?
- Bounds on the size of sets not containing a given finite pattern
- Roth's theorem and Behrend's lower bound
- Arithmetic Progressions of Squares
- Non-asymptotically densest progression-free sets
- Most dense subset of numbers that avoids arbitrarily long arithmetic progressions
- Subsets of [1..N] with no three-term arithmetic progressions and no large gaps
- Average size of $p$-part of the Tate-Shafarevich group for elliptic curves
- Capset problem but considering differences with bounded support
- Infinite constructions in additive combinatorics
Try a Google Search
Try searching for similar questions
Browse our recent questions
Browse our popular tags
If you feel something is missing that should be here, contact us.