Mathematical Sciences Seminar - Parking functions and tree depth
When:
—
Venue:
Birkbeck Main Building, Malet Street
No booking required
Elementary results show that the number of parking functions of length n is equinumerous with the set of trees on n+1 vertices. Kreweras (1980) showed that further statistics in the two structures are preserved; the number of parking functions with area k is equinumerous with the number of trees with k inversions.
In this talk, I will give a further refinement to the above formula and discuss other statistics on parking functions enumerated by the same generating series. I will thoroughly cover the classical enumerative results in this area before discussing new ones, so I will not assume any prior knowledge on this topic.
Contact name:
Department of Economics, Mathematics and Statistics