This paper studies permutations on a set that preserve the parity (even/odd count) of inversions of every subset of a fixed size k. It finds that, perhaps surprisingly, most of these permutation groups are trivial, cyclic, or dihedral. The paper generalizes semigroups of order-preserving and orientation-preserving mappings.