Largest minimal inversion-complete and pair-complete sets of permutations

Eric Balandraud, Maurice Queyranne, Fabio Tardella

We solve two related extremal problems in the theory of permutations. A set $Q$ of permutations of the integers 1 to $n$ is inversion-complete (resp., pair-complete) if for every i…