Decomposing sets of inversions
The electronic journal of combinatorics, Tome 20 (2013) no. 1
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

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

Lukas Katthän  1

1 Philipps-Universität Marburg
@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/}
}
TY  - JOUR
AU  - Lukas Katthän
TI  - Decomposing sets of inversions
JO  - The electronic journal of combinatorics
PY  - 2013
VL  - 20
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.37236/2609/
DO  - 10.37236/2609
ID  - 10_37236_2609
ER  - 
%0 Journal Article
%A Lukas Katthän
%T Decomposing sets of inversions
%J The electronic journal of combinatorics
%D 2013
%V 20
%N 1
%U http://geodesic.mathdoc.fr/articles/10.37236/2609/
%R 10.37236/2609
%F 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 :