1 problem
Cerbai–Claesson–Ferrari conjecture. For every , there is a bijection between and the permutations in that are -machine sortable.
Cerbai–Claesson–Ferrari conjecture. For every , there is a bijection between and the permutations in that are -machine sortable.