Timeline for What is the minimum length of a $k$-permutation-avoiding word on $n$ letters?
Current License: CC BY-SA 4.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 2, 2022 at 9:09 | comment | added | Bogdan | @ZachHunter Thank you for your interest! So far, for any fixed $k, p$, we can show $\mu(n, k) = \Omega(n^p)$. I would expect the real asymptotic to be exponential, like for $k = 4$, but there is no overwhelmingly convincing reason for that, it's just that it would feel strange if it wasn't. | |
| Sep 2, 2022 at 6:09 | comment | added | Zach Hunter | this is very interesting! could you mention a rough asymptotic you believe you can prove as a lower bound? | |
| Sep 1, 2022 at 23:58 | history | asked | Bogdan | CC BY-SA 4.0 |