Timeline for Reference request: Gessel interview's generating function identities
Current License: CC BY-SA 4.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 14 at 15:57 | vote | accept | Naysh | ||
| May 13 at 16:27 | answer | added | Ira Gessel | timeline score: 11 | |
| May 12 at 18:47 | comment | added | Sam Hopkins | @RichardStanley okay I admit I only looked at Result 3 when I made that comment (and indeed it is on the Wikipedia page). I guess Ira can explain 1 & 2, although 2 looks like a basic exponential theorem thing. | |
| May 12 at 18:43 | comment | added | Richard Stanley | Are Results 1 and 2 really well-known? On the other hand, Result 3 is a basic result in enumerative combinatorics going back to Carlitz and Riordan in 1953. It should appear in any book on the subject, such as my Enumerative Combinatorics, vol. 1, second ed., Prop. 1.4.4. | |
| May 12 at 18:31 | comment | added | Sam Hopkins | These are all pretty well-known (certainly Result 3 is very very well-known). Did you make an effort to look up any of these? For example, reading the Wikipedia pages you linked to? | |
| May 12 at 15:01 | history | asked | Naysh | CC BY-SA 4.0 |