Google, IBM & Meta Certificates — All 10,000+ Courses at 40% Off
One annual plan covers every course and certificate on Coursera. 40% off for a limited time.
Get Full Access
Explore the third lecture in a mathematics workshop series that delves into the combinatorics of maximal chains within non-crossing partition lattices, establishing connections between non-crossing partitions, parking functions, and the Tamari lattice. Building upon previous discussions of free cumulants and their relationship to random matrix theory, this 49-minute advanced mathematics talk, presented at the Erwin Schrödinger International Institute's Workshop on "Recent Perspectives on Non-crossing Partitions through Algebra, Combinatorics, and Probability," examines the intricate relationships between various mathematical structures and their applications in probability theory.
