Главная
Study mode:
on
1
Intro
2
INTRODUCTION
3
BACK TO THE MAIN QUESTION
4
ROUNDING TO A NET IN SO(3)
5
MAIN THEOREM
6
REDUCTION TO ADDITIVE COMBINATORICS
7
A HOMOMORPHISM WITH ERROR
8
CASE 1: A COCYCLE IS FAR FROM TRIVIAL
9
ALMOST COMMUTATORS
10
CASE 2: ALL COCYLES ARE ALMOST TRIVIAL
11
APPROXIMATE HOMOMORPHISMS INTO SO(3)
Description:
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.

Associativity Testing - Ben Green

Institute for Advanced Study
Add to list