Abstract
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.
| Original language | English |
|---|---|
| Pages (from-to) | XXIX-XXX |
| Journal | Electronic Journal of Combinatorics |
| Volume | 9 |
| Issue number | 2 |
| DOIs | |
| State | Published - 2002 |
ASJC Scopus Subject Areas
- Theoretical Computer Science
- Geometry and Topology
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics
- Applied Mathematics
Fingerprint
Dive into the research topics of 'Parking functions, stack-sortable permutations, and spaces of paths in the Johnson graph'. Together they form a unique fingerprint.Cite this
- APA
- Standard
- Harvard
- Vancouver
- Author
- BIBTEX
- RIS