Largest Minimal Inversion-Complete and Pair-Complete Sets of Permutations

@article{Balandraud2018LargestMI,
  title={Largest Minimal Inversion-Complete and Pair-Complete Sets of Permutations},
  author={{\'E}ric Balandraud and Fabio Tardella and Maurice Queyranne},
  journal={Combinatorica},
  year={2018},
  volume={38},
  pages={29-41}
}
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 inversion (j, i), where 1 ≤ i < j ≤ n, (resp., for every pair (i, j), where i 6= j) there exists a permutation in Q where j is before i. It is minimally inversion-complete if in… CONTINUE READING