Associativity Testing - Ben Green
Offered By: Institute for Advanced Study via YouTube
Course Description
Overview
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.
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
Related Courses
理论计算机科学基础 | Introduction to Theoretical Computer SciencePeking University via edX Introducción a la Teoría Combinatoria
Universidad Católica de Murcia via Miríadax 离散数学概论 Discrete Mathematics Generality
Peking University via Coursera Discrete Mathematics
Indian Institute of Technology, Ropar via Swayam Discrete Mathematics
Shanghai Jiao Tong University via Coursera