YoVDO

Perfect Matchings in Hyperfinite Graphings - Lecture 3

Offered By: Centre de recherches mathématiques - CRM via YouTube

Tags

Graph Theory Courses Group Theory Courses Probability Theory Courses Bipartite Graphs Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore the geometric structure of amenable groups and hyperfinite graphings in this 56-minute lecture by Gabor Kun. Delve into the fascinating world of perfect matchings and their applications in various fields. Learn about recent breakthrough results, including the solution to Tarski's circle squaring problem using measurable and Borel pieces. Discover how perfect matchings typically exist in bipartite cases of amenable groups and hyperfinite graphings. Examine the wide-ranging applications of these concepts, from probability theory to group theory and measurable equidecompositions. Gain insights into this advanced mathematical topic as part of the Measured Group Theory program at the Centre de recherches mathématiques.

Syllabus

Gabor Kun: Perfect matchings in hyperfinite graphings III


Taught by

Centre de recherches mathématiques - CRM

Related Courses

Introduction to Statistics: Probability
University of California, Berkeley via edX
Aléatoire : une introduction aux probabilités - Partie 1
École Polytechnique via Coursera
Einführung in die Wahrscheinlichkeitstheorie
Johannes Gutenberg University Mainz via iversity
Combinatorics and Probability
Moscow Institute of Physics and Technology via Coursera
Probability
University of Pennsylvania via Coursera