Timeline for Closed walks on an $n$-cube and alternating permutations
Current License: CC BY-SA 4.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 10, 2020 at 16:12 | vote | accept | bryanjaeho | ||
| Jul 18, 2020 at 23:34 | comment | added | Ira Gessel | Fedor's proof of (1) can be found in my paper with Richard Stanley, Algebraic enumeration, Handbook of Combinatorics, Vol. 2, pp. 1021–1061, Elsevier Sci. B. V., Amsterdam, 1995. dedekind.mit.edu/~rstan/pubs/pubfiles/79.pdf and in Anthony Mendes, A note on alternating permutations, Amer. Math. Monthly 114 (2007), no. 5, 437–440. jstor.org/stable/27642223. | |
| Jul 18, 2020 at 12:36 | history | edited | Fedor Petrov | CC BY-SA 4.0 |
added 805 characters in body
|
| Jul 18, 2020 at 12:01 | history | answered | Fedor Petrov | CC BY-SA 4.0 |