Timeline for Counting zero-sum free sequences of a given length in $\mathbb{Z}_n$
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 8, 2016 at 1:55 | vote | accept | Chebolu | ||
| Oct 8, 2016 at 1:55 | |||||
| Apr 5, 2015 at 2:00 | answer | added | Chebolu | timeline score: 0 | |
| Apr 3, 2015 at 1:43 | answer | added | Richard Stanley | timeline score: 2 | |
| Apr 2, 2015 at 21:05 | answer | added | Gerhard Paseman | timeline score: 0 | |
| Apr 2, 2015 at 20:47 | comment | added | Gerhard Paseman | Consider that a lower bound derives from the number of partitions of n-1 (say) into d parts. I would expect exponential growth in n even for d approaching n/e. Gerhard "Much Less For Bigger D" Paseman, 2015.04.02 | |
| Apr 2, 2015 at 20:40 | history | asked | Chebolu | CC BY-SA 3.0 |