Timeline for Enumeration Result [closed]
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 9, 2012 at 16:40 | history | closed |
Igor Rivin Benjamin Steinberg Qiaochu Yuan Anthony Quas Igor Pak |
not a real question | |
| May 8, 2012 at 21:05 | answer | added | Hugh Denoncourt | timeline score: 7 | |
| May 8, 2012 at 20:23 | comment | added | Patricia Hersh | I've heard people speak of ``enumeration'' as either giving a counting formula or else an explicit list of elements. So I'm not sure I'd call this an enumeration. But it's possible other people have different conventions, and in any case generating function equations are often interesting combinatorial results. You should probably listen though to the people on this site who have actually written books on enumerative combinatorics. | |
| May 8, 2012 at 20:21 | comment | added | Alexander Woo | Of course it depends on context. Like almost everything in mathematics, once there is a proof, it's all a matter of taste. But being a matter of taste does not mean it is arbitrary. See the first subchapter of Stanley's Enumerative Combinatorics for his comments. | |
| May 8, 2012 at 20:18 | comment | added | Igor Rivin | See en.wikipedia.org/wiki/Enumerative_combinatorics. Voting to close. | |
| May 8, 2012 at 20:12 | history | asked | ivo | CC BY-SA 3.0 |