Timeline for What alternatives are there to the binomial poset theory of generating function families?
Current License: CC BY-SA 4.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 13, 2021 at 19:16 | comment | added | Keshav Srinivasan | @OlegEroshkin I’m sorry, I didn’t mean to be rude. I assumed that this would be short enough for a comment, so I made a suggestion accordingly to encourage fuller answers to be posted. But if it is too long then fair enough. | |
| May 13, 2021 at 19:13 | comment | added | Oleg Eroshkin | @KeshavSrinivasan I found your comment to be rude. This answer provides helpful information and is too long for the comment. Why do you ask Ira to delete it? | |
| May 10, 2021 at 5:48 | comment | added | Keshav Srinivasan | OK, if they don’t address that specific question, then maybe you should delete this answer and just post these links in a comment? | |
| May 10, 2021 at 4:43 | comment | added | Ira Gessel | They give some examples, but they don't explain why some kinds of generating functions arise in enumeration and other conceivable kinds don't. These papers aren't hard to read; you can see for yourself. | |
| May 9, 2021 at 21:17 | comment | added | Keshav Srinivasan | But what do these two theories say about which families of generating functions are combinatorially meaningful? | |
| May 9, 2021 at 21:14 | history | answered | Ira Gessel | CC BY-SA 4.0 |