Parking Functions, Stack-Sortable Permutations, and Spaces of Paths in the Johnson Graph
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.
2014 ◽
Vol 556-562
◽
pp. 2540-2543
Keyword(s):
1980 ◽
Vol 85
(1)
◽
pp. 129-136
◽
Keyword(s):
2012 ◽
Vol 193-194
◽
pp. 1075-1078
Keyword(s):
2019 ◽
Vol 8
(2S11)
◽
pp. 3531-3534
Keyword(s):