Timeline for Number of permutations with longest increasing subsequences of length at most $n$
Current License: CC BY-SA 4.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 21, 2020 at 17:24 | comment | added | 4xion | Sorry the notation is unfortunate, talking about $k$-th moments of unitaries in $U(n)$ gives the reverse of the convention in the combinatorics literature. | |
| Jun 21, 2020 at 17:21 | comment | added | 4xion | Thanks! These references are helpful. I didn't know about the determinantal expression. I'll check the paper more carefully, but I guess you're saying the trivial upper bound of $\leq$min$\{k!,n^{2k}\}$ (with $\leq n^{2k}$ from the unitary integral expression) is asymptotically tight in $k$ for fixed $n$. | |
| Jun 20, 2020 at 1:41 | history | answered | Michael Albert | CC BY-SA 4.0 |