LOW-DEGREE BOOLEAN FUNCTIONS ON , WITH AN APPLICATION TO ISOPERIMETRY
From MaRDI portal
Publication:4635501
DOI10.1017/FMS.2017.24zbMATH Open1384.05149arXiv1511.08694OpenAlexW2963406632MaRDI QIDQ4635501FDOQ4635501
Yuval Filmus, David Ellis, Ehud Friedgut
Publication date: 23 April 2018
Published in: Forum of Mathematics, Sigma (Search for Journal in Brave)
Abstract: We prove that Boolean functions on , whose Fourier transform is highly concentrated on irreducible representations indexed by partitions of whose largest part has size at least , are close to being unions of cosets of stabilizers of -tuples. We also obtain an edge-isoperimetric inequality for the transposition graph on which is asymptotically sharp for subsets of of size , using eigenvalue techniques. We then combine these two results to obtain a sharp edge-isoperimetric inequality for subsets of of size , where is large compared to , confirming a conjecture of Ben Efraim in these cases.
Full work available at URL: https://arxiv.org/abs/1511.08694
Recommendations
- On some properties of the curvature and nondegeneracy of Boolean functions
- scientific article; zbMATH DE number 7692345
- Low complexity functions and convex sets in \(\mathbb{Z}^k\)
- On the structure of Boolean functions with small spectral norm
- On the structure of Boolean functions with small spectral norm
- The \(\ell_p\)-function on finite Boolean lattices
- A lower bound for the affinity level for almost all Boolean functions
- A role of lower semicontinuous functions in the combinatorial complexity of geometric problems
- A structure theorem for almost low-degree functions on the slice
- On Monotonicity Testing and Boolean Isoperimetric-type Theorems
Cites Work
- Title not available (Why is that?)
- Generating a random permutation with random transpositions
- A note on the edges of the n-cube
- Maximally Connected Arrays on the n-Cube
- Optimal Assignments of Numbers to Vertices
- On the maximum number of permutations with given maximal or minimal distance
- Hypergraphs, Entropy, and Inequalities
- Title not available (Why is that?)
- Intersecting families of permutations
- On the distribution of the Fourier spectrum of Boolean functions
- Title not available (Why is that?)
- Difference Equations, Isoperimetric Inequality and Transience of Certain Random Walks
- \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
- Assignment of Numbers to Vertices
- Intersecting families of permutations
- Stability for \(t\)-intersecting families of permutations
- Boolean functions whose Fourier transform is concentrated on the first two levels.
- A proof of the Cameron-Ku conjecture
- A quasi-stability result for dictatorships in \(S_n\)
- A stability result for balanced dictatorships in Sn
- Properties and applications of boolean function composition
- On non-optimally expanding sets in Grassmann graphs
Cited In (7)
- Stability for 1-intersecting families of perfect matchings
- Boolean degree 1 functions on some classical association schemes
- KKL's influence on me
- Inverse problems of the Erdős-Ko-Rado type theorems for families of vector spaces and permutations
- Title not available (Why is that?)
- A quasi-stability result for dictatorships in \(S_n\)
- Boolean function analysis on high-dimensional expanders
This page was built for publication: LOW-DEGREE BOOLEAN FUNCTIONS ON , WITH AN APPLICATION TO ISOPERIMETRY
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4635501)