Decomposing Sets of Inversions
Keywords:
Inversion sets, Permutation graphs, Simple Permutations, Linear Ordering Polytope
Abstract
In this paper we consider the question how the set of inversions of a permutation $\pi \in S_n$ can be partitioned into two subsets, which are themselves inversion sets of permutations in $S_n$. Our method is to study the modular decomposition of the inversion graph of $\pi$. A correspondence to the substitution decomposition of $\pi$ is also given. Moreover, we consider the special case of multiplicative decompositions.
Published
2013-02-25
How to Cite
Katthän, L. (2013). Decomposing Sets of Inversions. The Electronic Journal of Combinatorics, 20(1), P40. https://doi.org/10.37236/2609
Article Number
P40