Timeline for Ordering subsets of the cyclic group to give distinct partial sums
Current License: CC BY-SA 3.0
12 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| S Apr 18, 2015 at 23:38 | history | bounty ended | David E Speyer | ||
| S Apr 18, 2015 at 23:38 | history | notice removed | David E Speyer | ||
| Apr 16, 2015 at 18:21 | answer | added | Seva | timeline score: 7 | |
| Apr 15, 2015 at 14:54 | answer | added | Pace Nielsen | timeline score: 4 | |
| Apr 14, 2015 at 18:57 | comment | added | Seva | Is there a simple proof for the real case? That is, given a set of $k$ non-zero real numbers, can we order them so as to have all the partial sums $a_1+\dotsb+a_i\ (1\le i\le k)$ pairwise distinct? | |
| Apr 14, 2015 at 3:09 | answer | added | Will Sawin | timeline score: 3 | |
| S Apr 12, 2015 at 2:38 | history | bounty started | David E Speyer | ||
| S Apr 12, 2015 at 2:38 | history | notice added | David E Speyer | Authoritative reference needed | |
| Apr 28, 2014 at 7:34 | comment | added | Peter Dukes | I can confirm the Dan Archdeacon link. He told me this problem a few months ago. (seems tough to me) | |
| Apr 25, 2014 at 4:12 | comment | added | domotorp | I don't know if this has been studied before, but some relevant problems, most of which probably you are aware of: openproblemgarden.org/op/snevilys_conjecture, mathoverflow.net/questions/24108/…, cs.elte.hu/blobs/diplomamunkak/msc_mat/2013/… | |
| Apr 25, 2014 at 3:24 | review | First posts | |||
| Apr 25, 2014 at 4:08 | |||||
| Apr 25, 2014 at 3:05 | history | asked | Ian Wanless | CC BY-SA 3.0 |