Boolean functions and Bonami's lemma
From MaRDI portal
Cites work
- A lower bound on the constant in the Fourier min-entropy/influence conjecture
- A Mathematical Theory of Communication
- A Remarkable Series of Orthogonal Functions (I)
- An analogue of Bonami's Lemma for functions on spaces of linear maps, and 2-2 Games
- Analysis of Boolean Functions
- Boolean functions whose Fourier transform is concentrated on the first two levels.
- Decision trees, protocols and the entropy-influence conjecture
- Edge-Isoperimetric Inequalities and Influences
- Ensembles (p) dans le dual de D^
- Every monotone graph property has a sharp threshold
- scientific article; zbMATH DE number 3174732 (Why is no real title available?)
- scientific article; zbMATH DE number 3014822 (Why is no real title available?)
- Hypercontractivity for global functions and sharp thresholds
- Improved bounds on Fourier entropy and min-entropy
- Inequalities in Fourier analysis
- Isoperimetry, logarithmic Sobolev inequalities on the discrete cube, and Margulis' graph connectivity theorem
- Logarithmic Sobolev Inequalities
- The Fourier entropy-influence conjecture for certain classes of Boolean functions
- Towards a proof of the Fourier-entropy conjecture?
- Étude des coefficients de Fourier des fonctions de \(L^ p(G)\)
This page was built for publication: Boolean functions and Bonami's lemma
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6956913)