Skip to content (access key 's')
Logo of Technion
Logo of CS Department
Events

The Taub Faculty of Computer Science Events and Talks

Complexity Measures on the Symmetric Group and Beyond
event speaker icon
Neta Dafni
event date icon
Tuesday, 16.11.2021, 12:30
event location icon
Zoom Lecture: 770181440
We study complexity measures of Boolean functions on the symmetric group and other domains. This generalizes classical work on functions over the Boolean cube. Additionally, we construct efficient circuits for low sensitivity functions. Using our theory we give an alternate proof for the characterization of extremal t-setwise-intersecting families of permutations. Joint work with Yuval Filmus, Noam Lifshitz, Nathan Lindzey and Marc Vinyals