Friedgut--Kalai--Naor theorem for slices of the Boolean cube
From MaRDI portal
Publication:3179336
DOI10.4086/cjtcs.2016.014zbMath1401.06014arXiv1410.7834OpenAlexW4254238913MaRDI QIDQ3179336
Publication date: 21 December 2016
Published in: Chicago Journal of Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1410.7834
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (18)
Log-Sobolev inequality for the multislice, with applications ⋮ Boolean degree 1 functions on some classical association schemes ⋮ An orthogonal basis for functions over a slice of the Boolean hypercube ⋮ A simple removal lemma for large nearly-intersecting families ⋮ A family of weightwise (almost) perfectly balanced Boolean functions with optimal algebraic immunity ⋮ Construction of weightwise perfectly balanced Boolean functions with high weightwise nonlinearity ⋮ Structure and supersaturation for intersecting families ⋮ A new construction of weightwise perfectly balanced Boolean functions ⋮ Degree 2 Boolean functions on Grassmann graphs ⋮ Boolean functions on $S_n$ which are nearly linear ⋮ Unnamed Item ⋮ A structure theorem for almost low-degree functions on the slice ⋮ Weightwise perfectly balanced functions with high weightwise nonlinearity profile ⋮ Unnamed Item ⋮ Equivalent definitions for (degree one) Cameron-Liebler classes of generators in finite classical polar spaces ⋮ Removal and Stability for Erdös--Ko--Rado ⋮ On non-optimally expanding sets in Grassmann graphs ⋮ FKN theorem for the multislice, with applications
Cites Work
- A simple reduction from a biased measure on the discrete cube to the uniform measure
- On the measure of intersecting families, uniqueness and stability
- The diametric theorem in Hamming spaces---optimal anticodes
- Boolean functions with low average sensitivity depend on few coordinates
- FKN Theorem on the biased cube
This page was built for publication: Friedgut--Kalai--Naor theorem for slices of the Boolean cube