Title: Complexity Measures on the Symmetric Group and Beyond
| Speaker: | Nathan Lindzey |
| Affiliation: | CU Boulder |
| Zoom: | Contact Soffia Arnadottir |
Abstract:
A classical result in complexity theory states that a degree-d Boolean function on the hypercube can be computed using a decision tree of depth poly(d). Conversely, a Boolean function computed by a decision tree of depth d has degree at most d. Thus degree and decision tree complexity are polynomially related. Many other complexity measures of Boolean functions on the hypercube are polynomially related to the degree (e.g., approximate degree, certificate complexity, block sensitivity), and last year Huang famously added sensitivity to the list. Can we prove similar results for Boolean functions on other combinatorial domains?
We give natural extensions of many complexity measures (e.g., degree, approximate degree, decision tree complexity, sensitivity, block sensitivity) to domains such as the symmetric group, perfect matchings, k-sets, and a few others. We show that these complexity measures are polynomially related by generalizing classical arguments of Nisan (and others) and reducing to Huang's sensitivity theorem using so-called "pseudo-characters", which witness the degree of a function. As an application, we give a characterization of the degree-1 Boolean functions of the perfect matching scheme and we simplify the characterization of maximum-size t-intersecting families in the symmetric group and the perfect matching scheme.