Parking functions, stack-sortable permutations, and spaces of paths in the Johnson graph
The electronic journal of combinatorics, Permutation Patterns, Tome 9 (2002) no. 2
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

We prove that the space of possible final configurations for a parking problem is parameterized by the vertices of a regular Bruhat graph associated to a 231-avoiding permutation, and we show how this relates to parameterizing certain spaces of paths in the Johnson graph.
DOI : 10.37236/1683
Classification : 05A05, 05C38
Mots-clés : regular Bruhat graph
@article{10_37236_1683,
     author = {Catalin Zara},
     title = {Parking functions, stack-sortable permutations, and spaces of paths in the {Johnson} graph},
     journal = {The electronic journal of combinatorics},
     year = {2002},
     volume = {9},
     number = {2},
     doi = {10.37236/1683},
     zbl = {1011.05002},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/1683/}
}
TY  - JOUR
AU  - Catalin Zara
TI  - Parking functions, stack-sortable permutations, and spaces of paths in the Johnson graph
JO  - The electronic journal of combinatorics
PY  - 2002
VL  - 9
IS  - 2
UR  - http://geodesic.mathdoc.fr/articles/10.37236/1683/
DO  - 10.37236/1683
ID  - 10_37236_1683
ER  - 
%0 Journal Article
%A Catalin Zara
%T Parking functions, stack-sortable permutations, and spaces of paths in the Johnson graph
%J The electronic journal of combinatorics
%D 2002
%V 9
%N 2
%U http://geodesic.mathdoc.fr/articles/10.37236/1683/
%R 10.37236/1683
%F 10_37236_1683
Catalin Zara. Parking functions, stack-sortable permutations, and spaces of paths in the Johnson graph. The electronic journal of combinatorics, Permutation Patterns, Tome 9 (2002) no. 2. doi: 10.37236/1683

Cité par Sources :