×

zbMATH — the first resource for mathematics

Parking functions, stack-sortable permutations, and spaces of paths in the Johnson graph. (English) Zbl 1011.05002
Electron. J. Comb. 9, No. 2, Research paper R11, 11 p. (2002-2003); printed version J. Comb. 9, No. 2, R11 (2002-2003).
Summary: 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.
MSC:
05A05 Permutations, words, matrices
05C38 Paths and cycles
PDF BibTeX XML Cite
Full Text: EMIS EuDML