Partially well-ordered closed sets of permutations (Q698442)

If by ``permutation'' one means a bijection on \(N=\{1,2, \dots\}\) leaving all but a finite set of elements fixed and if \(\sigma\leq\tau\) when the orbit of \(\tau\) has a subsequence order-isomorphic to the orbit of \(\sigma\), then this involvement order on the set of ``permutations'' admits infinite antichains, new examples of which are given in this paper, which is sufficient to show that this set is not partially well-ordered (pwo) since this means that properly descending chains and antichains are both finite. It is known that many interesting sets of permutations are pwo and in this paper several new classes are teased out via techniques developed here. Together with previous results, the results obtained in this paper are meant also to improve insight in the nature of the boundary between pwo and non-pwo conditions in the ``permutation''-setting as considered.