English

A braid group action on parking functions

Representation Theory 2013-09-23 v2 Combinatorics

Abstract

We construct an action of the braid group on nn strands on the set of parking functions of nn cars such that elementary braids have orbits of length 2 or 3. The construction is motivated by a theorem of Lyashko and Looijenga stating that the number of the distinguished bases for AnA_n singularity equals (n+1)n1(n+1)^{n-1} and thus equals the number of parking functions. We construct an explicit bijection between the set of parking functions and the set of distinguished bases, which allows us to translate the braid group action on distinguished bases in terms of parking functions.

Keywords

Cite

@article{arxiv.1112.0381,
  title  = {A braid group action on parking functions},
  author = {Evgeny Gorsky and Mikhail Gorsky},
  journal= {arXiv preprint arXiv:1112.0381},
  year   = {2013}
}

Comments

18 pages, v2: the focus of the paper shifted towards the braid group action on parking functions; as a result, title and abstract were updated, and text was edited significantly

R2 v1 2026-06-21T19:45:05.911Z