Timeline for Number of non-crossing sets of intervals
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 30, 2020 at 23:56 | history | edited | Sam Hopkins | CC BY-SA 4.0 |
added 189 characters in body
|
| Mar 30, 2020 at 23:53 | comment | added | Sam Hopkins | @Julian: ah, yes, I see- if we think of the little Schroeder numbers as counting (not necessarily maximal) dissections of an $n$-gon then this interpretation is indeed clear. | |
| Mar 30, 2020 at 23:16 | comment | added | Julian | Thanks! Small addition: The little-Schroeder numbers count the number of non-crossing graphs on the circle without next-neighbour edges. Since there are $n$ such next-neighbour edges it follows that the total number of graphs is $2^n$ times the little-Schroeder numbers. For more details on the generating functions the paper <mathscinet.ams.org/mathscinet-getitem?mr=345872> is also a good reference. | |
| Mar 30, 2020 at 23:10 | vote | accept | Julian | ||
| Mar 30, 2020 at 18:15 | history | answered | Sam Hopkins | CC BY-SA 4.0 |