1 problem

0 votes0 replies0 views
Wastlund's half-\bound conjecture for sorting permutations by block transpositions
Wastlund's conjecture. If $n\neq 13$ and $n\neq 15$ , then every $n$ -permutation can be sorted by at most
Conjectureopenblock-transpositions combinatorics permutation-sortingarXiv posted 2 days ago

Wastlund's half-\bound conjecture for sorting permutations by block transpositions