Perfect Matchings in Hyperfinite Graphings - Lecture 1
Offered By: Centre de recherches mathématiques - CRM via YouTube
Course Description
Overview
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
Related Courses
Aplicaciones de la teoría de grafos a la vida realMiríadax Aplicaciones de la Teoría de Grafos a la vida real
Universitat Politècnica de València via UPV [X] Introduction to Computational Thinking and Data Science
Massachusetts Institute of Technology via edX Genome Sequencing (Bioinformatics II)
University of California, San Diego via Coursera Algorithmic Information Dynamics: From Networks to Cells
Santa Fe Institute via Complexity Explorer