Decomposing sets of inversions
The electronic journal of combinatorics, Tome 20 (2013) no. 1
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.
DOI :
10.37236/2609
Classification :
05A05, 52B12, 05E40
Mots-clés : inversion sets, permutation graphs, simple permutations, linear ordering polytope
Mots-clés : inversion sets, permutation graphs, simple permutations, linear ordering polytope
Affiliations des auteurs :
Lukas Katthän  1
@article{10_37236_2609,
author = {Lukas Katth\"an},
title = {Decomposing sets of inversions},
journal = {The electronic journal of combinatorics},
year = {2013},
volume = {20},
number = {1},
doi = {10.37236/2609},
zbl = {1267.05009},
url = {http://geodesic.mathdoc.fr/articles/10.37236/2609/}
}
Lukas Katthän. Decomposing sets of inversions. The electronic journal of combinatorics, Tome 20 (2013) no. 1. doi: 10.37236/2609
Cité par Sources :