Explore a 51-minute lecture on Representation Theory and its applications in Theoretical Computer Science (TCS) and Extremal Combinatorics. Gain insights from Nathan Lindzey of Technion - Israel Institute of Technology as he presents "Beyond the Boolean Cube." Discover how Representation Theory can be used to extend the theory of Boolean functions to other domains, leading to new results in TCS and Extremal Combinatorics. Learn through a gentle introduction to the subject, making it accessible for those new to the field while still offering valuable insights for experienced researchers.
Representation Theory in TCS and Extremal Combinatorics
Overview
Syllabus
Representation Theory in TCS and Extremal Combinatorics
Taught by
Simons Institute
Related Courses
-
Applications in Extremal Combinatorics - Lecture 1
-
Commutative Algebra to Representation Theory Through the Combinatorics of Filtered RSK
-
Applications in Extremal Combinatorics - Lecture 2
-
Additive Number Theory - Extremal Problems and the Combinatorics of Sumsets by M. Nathanson
-
Discrete Mathematics
-
Structure of Boolean Almost Low Degree Functions on the Biased Cube
