University of Cambridge > Talks.cam > Probability > Probabilizing Parking Functions

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹ️ Information

Probabilizing Parking Functions

Download to your calendar using vCal

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 lists

in person & via zoom Lightfoot Room, Old Divinity School, St John’s College, CB2 1TP Veritas Forum Cambridge

Other talks

Tea and Coffee Break The physics of decision: how competitive systems compute, route, and remember What’s my reproduction number? Life history strategies: an interdisciplinary perspective Title to be confirmed Packing the Border: Quail Crates and the Regulation of Animal Movement on the US-Mexico Border, 1910s-1940s Alicia Anderson discussing some exciting news about HARPS3
 

© 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity