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
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.
@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/}
}
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 :