Decomposing random permutations into order-isomorphic subpermutations

Carla Groenland, Tom Johnston, Dániel Korándi +3

Two permutations $s$ and $t$ are $k$-similar if they can be decomposed into subpermutations $s^1,\dots ,s^k$ and $t^1,\dots ,t^k$ such that $s^i$ is order-isomorphic to $t^i$ f…