LOW-DEGREE BOOLEAN FUNCTIONS ON , WITH AN APPLICATION TO ISOPERIMETRY
From MaRDI portal
(Redirected from Publication:4635501)
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.
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\)
- The _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
- scientific article; zbMATH DE number 5544145 (Why is no real title available?)
- scientific article; zbMATH DE number 51129 (Why is no real title available?)
- scientific article; zbMATH DE number 3552764 (Why is no real title available?)
- A note on the edges of the n-cube
- A proof of the Cameron-Ku conjecture
- A quasi-stability result for dictatorships in S_n
- A stability result for balanced dictatorships in S_n
- Assignment of Numbers to Vertices
- Boolean functions whose Fourier transform is concentrated on the first two levels.
- Difference Equations, Isoperimetric Inequality and Transience of Certain Random Walks
- Generating a random permutation with random transpositions
- Hypergraphs, entropy, and inequalities
- Intersecting families of permutations
- Intersecting families of permutations
- Maximally Connected Arrays on the n-Cube
- On non-optimally expanding sets in Grassmann graphs
- On the distribution of the Fourier spectrum of Boolean functions
- On the maximum number of permutations with given maximal or minimal distance
- Optimal Assignments of Numbers to Vertices
- Properties and applications of Boolean function composition
- Stability for t-intersecting families of permutations
- \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
Cited in
(9)- Stability for 1-intersecting families of perfect matchings
- Boolean function analysis on high-dimensional expanders
- A stability result for balanced dictatorships in S_n
- 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
- A quasi-stability result for dictatorships in S_n
- Boolean function analysis on high-dimensional expanders
- An isoperimetric inequality for conjugation-invariant sets in the symmetric group
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)