Perfect Matchings in Hyperfinite Graphings - Lecture 1
Centre de recherches mathématiques - CRM via YouTube
Get 20% off all career paths from fullstack to AI
Google, IBM & Microsoft Certificates — All in One Plan
Overview
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 fascinating world of perfect matchings in hyperfinite graphings in this one-hour lecture by Gabor Kun. Delve into the geometric structure of amenable groups and hyperfinite graphings, focusing on their bipartite cases and the typical existence of perfect matchings. Discover how recent breakthroughs in this field have led to significant advancements, including the solution to Tarski's circle squaring problem using measurable and Borel pieces. Examine the wide-ranging applications of perfect matchings, from probability theory to group theory and measurable equidecompositions. This talk, part of the Measured Group Theory series at the Centre de recherches mathématiques, offers valuable insights into this tractable yet powerful mathematical concept.
Syllabus
Gabor Kun: Perfect matchings in hyperfinite graphings I
Taught by
Centre de recherches mathématiques - CRM