Timeline for Lower bounds on the easier Waring problem
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 12, 2011 at 18:33 | vote | accept | Boris Bukh | ||
| May 12, 2011 at 10:29 | answer | added | Trevor Wooley | timeline score: 19 | |
| May 11, 2011 at 23:12 | comment | added | Boris Bukh | @Ben: I agree that the answer is probably "yes, there is such a $k$". However, I found myself unable to prove it, hence the question. | |
| May 11, 2011 at 22:49 | comment | added | Ben Green | Boris, One would think so, because your set is contained in the difference set S of the set of things which are the sum of at most 5 positive kth powers, and there seems little reason to suspect that $S$ behaves so much unlike a random set with $n^{5/k}$ elements up to $n$. Proving it would be quite a different matter. Maybe some papers of Browning and Heath-Brown are relevant.... | |
| May 11, 2011 at 20:06 | answer | added | Will Jagy | timeline score: 5 | |
| May 11, 2011 at 18:43 | comment | added | Gerhard Paseman | Upon reflection, it is not clear at all that there is such a k. Gerhard "Needed To Drink Some Coffee" Paseman, 2011.05.11 | |
| May 11, 2011 at 18:31 | comment | added | Gerhard Paseman | shouldn't k=6 come easily? Set N large , then if x_5 is the largest term (at least N) then at most 32N^4 additional terms can be formed with it? Gerhard "Ask Me About System Design" Paseman, 2011.05.11 | |
| May 11, 2011 at 16:06 | history | asked | Boris Bukh | CC BY-SA 3.0 |