Timeline for Asymptotic Methods in Combinatorics
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 25, 2011 at 21:34 | comment | added | Michael Lugo | Pemantle gave a series of six lectures on this at the 2009 Cornell Probability Summer School : math.upenn.edu/~pemantle/Cornell-Lectures-2009.html . There are also lecture notes for a semester-long graduate course at math.upenn.edu/~pemantle/581-html/lecture-notes.html (which I took) but these are somewhat incomplete; in particular in those courses we never really got to doing examples. There are plenty of references there for the theory, though. | |
| May 25, 2011 at 21:21 | comment | added | David E Speyer | Agreed. Pemantle's work for me is in the category of "if you have to solve this sort of problem, he will tell you how, but try to think about whether you can solve a simpler problem instead." | |
| May 25, 2011 at 21:04 | comment | added | Igor Rivin | Pemantle's work is very impressive, but the problems there are very hard, and if you actually want to know some asymptotics, you should avoid the multivariable case. | |
| May 25, 2011 at 20:59 | history | answered | David E Speyer | CC BY-SA 3.0 |