2026-07-26T10:55:57Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:13626 2024-03-06T10:52:29Z ddc:004 open_access

Complexity Measures on the Symmetric Group and Beyond (Extended Abstract) Dafni, Neta Filmus, Yuval Lifshitz, Noam Lindzey, Nathan Vinyals, Marc Computational Complexity Theory Analysis of Boolean Functions Complexity Measures Extremal Combinatorics We extend the definitions of complexity measures of functions to domains such as the symmetric group. The complexity measures we consider include degree, approximate degree, decision tree complexity, sensitivity, block sensitivity, and a few others. We show that these complexity measures are polynomially related for the symmetric group and for many other domains. To show that all measures but sensitivity are polynomially related, we generalize classical arguments of Nisan and others. To add sensitivity to the mix, we reduce to Huang’s sensitivity theorem using "pseudo-characters", which witness the degree of a function. Using similar ideas, we extend the characterization of Boolean degree 1 functions on the symmetric group due to Ellis, Friedgut and Pilpel to the perfect matching scheme. As another application of our ideas, we simplify the characterization of maximum-size t-intersecting families in the symmetric group and the perfect matching scheme. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Neta Dafni and Yuval Filmus and Noam Lifshitz and Nathan Lindzey and Marc Vinyals 2021 Is Part Of LIPIcs, Volume 185, 12th Innovations in Theoretical Computer Science Conference (ITCS 2021) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.ITCS.2021.87 urn:nbn:de:0030-drops-136267 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2021.87 eng https://creativecommons.org/licenses/by/3.0/legalcode