Explore the intricacies of associativity testing in this 58-minute Computer Science and Discrete Mathematics seminar presented by Ben Green from the University of Oxford. Delve into key topics including the main question, rounding to a net in SO(3), the main theorem, and reduction to additive combinatorics. Examine cases involving cocycles and their proximity to triviality, almost commutators, and approximate homomorphisms into SO(3). Gain insights into this complex mathematical concept through a structured exploration of its various aspects and applications.
Overview
Syllabus
Intro
INTRODUCTION
BACK TO THE MAIN QUESTION
ROUNDING TO A NET IN SO(3)
MAIN THEOREM
REDUCTION TO ADDITIVE COMBINATORICS
A HOMOMORPHISM WITH ERROR
CASE 1: A COCYCLE IS FAR FROM TRIVIAL
ALMOST COMMUTATORS
CASE 2: ALL COCYLES ARE ALMOST TRIVIAL
APPROXIMATE HOMOMORPHISMS INTO SO(3)
Taught by
Institute for Advanced Study
