Parking functions, stack-sortable permutations, and spaces of paths in the Johnson graph (Q1871366)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Parking functions, stack-sortable permutations, and spaces of paths in the Johnson graph |
scientific article; zbMATH DE number 1907089
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Parking functions, stack-sortable permutations, and spaces of paths in the Johnson graph |
scientific article; zbMATH DE number 1907089 |
Statements
Parking functions, stack-sortable permutations, and spaces of paths in the Johnson graph (English)
0 references
7 May 2003
0 references
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.
0 references
regular Bruhat graph
0 references
0.8872866
0 references
0.8795017
0 references
0.8782569
0 references
0.8778886
0 references
0.87065583
0 references
0.86300755
0 references
0.8617058
0 references
