|COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring.|
Probabilizing Parking Functions
If you have a question about this talk, please contact Perla Sousi.
Parking functions are a novel combinatorial object that come up in computer science hashing, in chip-firing games, MacDonald polynomials and ‘all over the place’. One way to study a new object is to ask ‘what does a typical one ‘look like’?’. In joint work with Angela Hicks, we find new facts about parking functions (what’s the distribution of pi(1)?) and new uses for for some esoteric facts about Brownian excursion. The search also illuminates the statistical mechanics mantra of equivalence of ensembles.
This talk is part of the Probability series.
This talk is included in these lists:
Note that ex-directory lists are not shown.
Other listsPost-Slavery Societies Workshop Clare Politics SCAMPS 09 - One day Symposium
Other talksHow does recent linguistic experience result in a retuning of lexical-semantic representations? Ubiquitous Sensing with Light RNA Polymerase III Gene Transcription In Health And Disease: Unveiling The Molecular Mechanisms by Integrated Structural Biology The Emergence of the Sovereign Consumer – from Adam Smith to the Socialist Calculation Debate Global Investment In The 21st Century....And How Sustainability Is Shaping It Hegemony and its discontents: translating Gramsci with Dalit Subalterns