Timeline for How small can a sum of a few roots of unity be?
Current License: CC BY-SA 2.5
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 1, 2019 at 22:51 | comment | added | Gerry Myerson | @Ben, I'm always happy to see work on this problem. | |
| Aug 1, 2019 at 19:21 | comment | added | Ben Barber | @GerryMyerson, I have a moderate amount of data (computed by other means) that I'd be happy to share with you but can't sensibly post as an answer. | |
| Jul 3, 2011 at 14:49 | comment | added | Noam D. Elkies | Likewise if 3|n with triples, etc.; and when there are several small factors one can combine dependencies in somewhat less transparent ways – e.g. we have $0 = e(0)+e(1/5)+e(2/5)+e(3/5)+e(4/5)$ $= -e(1/2)+e(1/5)+e(2/5)+e(3/5)+e(4/5)$ $= e(1/6)+e(5/6) + e(1/5)+e(2/5)+e(3/5)+e(4/5)$, giving a vanishing sum of the 5th, 25th, 6th, 12th, 18th, and 24th powers of a primitive 30th root of unity. | |
| Nov 16, 2010 at 3:49 | comment | added | Aaron Meyerowitz | In the event that n is even wouldn't you get pairs of vectors whose last two components were antipodal giving a sum of weight 2? | |
| Nov 15, 2010 at 20:53 | comment | added | Gerry Myerson | I'd love to see someone implement this and get some numbers out. | |
| Nov 15, 2010 at 16:17 | history | edited | Felipe Voloch | CC BY-SA 2.5 |
fixed TeX
|
| Nov 15, 2010 at 11:52 | history | answered | Roland Bacher | CC BY-SA 2.5 |