Abstract
We give a gentle introduction to Representation Theory and show how it can be used to extend the theory of Boolean functions to other domains to obtain new results in TCS and Extremal Combinatorics.
We give a gentle introduction to Representation Theory and show how it can be used to extend the theory of Boolean functions to other domains to obtain new results in TCS and Extremal Combinatorics.