A braid group action on parking functions

preprint2013arXivOpen access

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)n−1(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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.