Timeline for Combinatorial Morse functions and random permutations
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 8, 2014 at 16:27 | comment | added | Ira Gessel | I believe that the upper bound should be $L\leq (405581/10!)^{1/10} = 0.80321\cdots$, which may be compared to the actual value $L=0.7693323708\cdots$. | |
| Nov 20, 2012 at 21:47 | comment | added | Liviu Nicolaescu | Here are some related asymptotics front.math.ucdavis.edu/1202.2724 | |
| Nov 20, 2012 at 21:44 | vote | accept | Liviu Nicolaescu | ||
| Nov 20, 2012 at 21:32 | history | edited | Richard Stanley | CC BY-SA 3.0 |
bound for k=10 added
|
| Nov 20, 2012 at 20:50 | history | edited | Richard Stanley | CC BY-SA 3.0 |
"A further thought" paragraph added.
|
| Nov 20, 2012 at 19:01 | comment | added | Liviu Nicolaescu | Very nice and so simple! | |
| Nov 20, 2012 at 17:10 | history | answered | Richard Stanley | CC BY-SA 3.0 |