Timeline for (Approximate) Number of ways to partition $n$ elements into ordered subsets of bounded size
Current License: CC BY-SA 3.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 14, 2017 at 7:45 | comment | added | Bruno Salvy | For constant c these methods apply directly and are even implemented in computer algebra. For c growing like sqrt(n), you usually have to justify separately that the integral is indeed concentrated where you expect it to be. | |
| Feb 13, 2017 at 3:53 | vote | accept | Lee Goodloe | ||
| Feb 11, 2017 at 20:11 | comment | added | Pat Devlin | See the bottom of page 9 of this pdf for how to estimate the coefficients of the exponential power series given in the third edit. It seems like those techniques would work here. math.upenn.edu/~pemantle/papers/twenty.pdf | |
| Feb 11, 2017 at 19:47 | history | edited | Pat Devlin | CC BY-SA 3.0 |
added 371 characters in body
|
| Feb 11, 2017 at 18:52 | history | edited | Pat Devlin | CC BY-SA 3.0 |
added 123 characters in body
|
| Feb 11, 2017 at 18:46 | history | edited | Pat Devlin | CC BY-SA 3.0 |
edited body
|
| Feb 11, 2017 at 18:34 | history | edited | Pat Devlin | CC BY-SA 3.0 |
added 461 characters in body
|
| Feb 11, 2017 at 17:50 | history | edited | Pat Devlin | CC BY-SA 3.0 |
edited body; deleted 2 characters in body
|
| Feb 11, 2017 at 17:45 | history | answered | Pat Devlin | CC BY-SA 3.0 |