Pattern avoidance classes and subpermutations
The electronic journal of combinatorics, Tome 12 (2005)
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

Pattern avoidance classes of permutations that cannot be expressed as unions of proper subclasses can be described as the set of subpermutations of a single bijection. In the case that this bijection is a permutation of the natural numbers a structure theorem is given. The structure theorem shows that the class is almost closed under direct sums or has a rational generating function.
DOI : 10.37236/1957
Classification : 05A15, 05A16, 05A05
Mots-clés : restricted permutations, permutation patterns
@article{10_37236_1957,
     author = {M. D. Atkinson and M. M. Murphy and N. Ru\v{s}kuc},
     title = {Pattern avoidance classes and subpermutations},
     journal = {The electronic journal of combinatorics},
     year = {2005},
     volume = {12},
     doi = {10.37236/1957},
     zbl = {1081.05006},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/1957/}
}
TY  - JOUR
AU  - M. D. Atkinson
AU  - M. M. Murphy
AU  - N. Ruškuc
TI  - Pattern avoidance classes and subpermutations
JO  - The electronic journal of combinatorics
PY  - 2005
VL  - 12
UR  - http://geodesic.mathdoc.fr/articles/10.37236/1957/
DO  - 10.37236/1957
ID  - 10_37236_1957
ER  - 
%0 Journal Article
%A M. D. Atkinson
%A M. M. Murphy
%A N. Ruškuc
%T Pattern avoidance classes and subpermutations
%J The electronic journal of combinatorics
%D 2005
%V 12
%U http://geodesic.mathdoc.fr/articles/10.37236/1957/
%R 10.37236/1957
%F 10_37236_1957
M. D. Atkinson; M. M. Murphy; N. Ruškuc. Pattern avoidance classes and subpermutations. The electronic journal of combinatorics, Tome 12 (2005). doi: 10.37236/1957

Cité par Sources :