Timeline for Additive combinatorics and large Fourier coefficients
Current License: CC BY-SA 2.5
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 30, 2010 at 6:08 | vote | accept | Andreas Thom | ||
| Aug 29, 2010 at 16:13 | comment | added | Ben Green | Absolutely right. I believe you can use this iteratively to prove Chang's inequality, mentioned by Kevin O'Bryant above. There is a paper of Bourgain (Lambda(p) subsets of squares, perhaps) where, instead of recalling an appropriate reference to this theory, he merely says "by linearisation". | |
| Aug 26, 2010 at 18:41 | history | edited | Andreas Thom | CC BY-SA 2.5 |
added 57 characters in body
|
| Aug 26, 2010 at 18:36 | history | answered | Andreas Thom | CC BY-SA 2.5 |