Composability of permutation classes
The electronic journal of combinatorics, Tome 26 (2019) no. 1
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

We define the operation of composing two hereditary classes of permutations using the standard composition of permutations as functions and we explore properties and structure of permutation classes considering this operation. We mostly concern ourselves with the problem of whether permutation classes can be composed from their proper subclasses. We provide examples of classes which can be composed from two proper subclasses, classes which can be composed from three but not from two proper subclasses and classes which cannot be composed from any finite number of proper subclasses.
DOI : 10.37236/6951
Classification : 05A05

Mark Karpilovskij  1

1 Charles University
@article{10_37236_6951,
     author = {Mark Karpilovskij},
     title = {Composability of permutation classes},
     journal = {The electronic journal of combinatorics},
     year = {2019},
     volume = {26},
     number = {1},
     doi = {10.37236/6951},
     zbl = {1409.05009},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/6951/}
}
TY  - JOUR
AU  - Mark Karpilovskij
TI  - Composability of permutation classes
JO  - The electronic journal of combinatorics
PY  - 2019
VL  - 26
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.37236/6951/
DO  - 10.37236/6951
ID  - 10_37236_6951
ER  - 
%0 Journal Article
%A Mark Karpilovskij
%T Composability of permutation classes
%J The electronic journal of combinatorics
%D 2019
%V 26
%N 1
%U http://geodesic.mathdoc.fr/articles/10.37236/6951/
%R 10.37236/6951
%F 10_37236_6951
Mark Karpilovskij. Composability of permutation classes. The electronic journal of combinatorics, Tome 26 (2019) no. 1. doi: 10.37236/6951

Cité par Sources :