2 problems
Let be a uniformly random permutation in the symmetric group , and let denote one step of Pop-Stack Sorting, which reverses every maximal…
Wastlund's conjecture. If and , then every -permutation can be sorted by at most
Let be a uniformly random permutation in the symmetric group , and let denote one step of Pop-Stack Sorting, which reverses every maximal…
Wastlund's conjecture. If and , then every -permutation can be sorted by at most