Timeline for Lower bound for constrained ordered partitions (i.e., compositions)?
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 9, 2014 at 15:11 | review | Close votes | |||
| Mar 9, 2014 at 20:34 | |||||
| Mar 9, 2014 at 14:54 | comment | added | Douglas Zare | $c(m) N^m$ obviously can't be a lower bound, since $N^m/N$ is an upper bound. You can also rule out $c(N) N^m.$ The CLT tells you what to expect. | |
| Mar 8, 2014 at 21:57 | answer | added | mathse | timeline score: 1 | |
| Jan 19, 2013 at 7:20 | answer | added | matthias beck | timeline score: 2 | |
| Jan 17, 2013 at 0:56 | history | asked | user30706 | CC BY-SA 3.0 |