An Entropic Proof of Chang's Inequality

DOI10.1137/120877982zbMath1315.94151arXiv1205.0263OpenAlexW2121965357MaRDI QIDQ4979832

Moore, Cristopher, Russell Impagliazzo, Alexander Russell

Publication date: 19 June 2014

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1205.0263

zbMATH Keywords

Fourier analysisBoolean functionsChang's lemma

Mathematics Subject Classification ID

Fourier series and coefficients in several variables (42B05) Arithmetic combinatorics; higher degree uniformity (11B30)

Related Items (8)

Biased halfspaces, noise sensitivity, and local Chernoff inequalities ⋮ Fooling Polytopes ⋮ Covering the Large Spectrum and Generalized Riesz Products ⋮ Chvátal's conjecture and correlation inequalities ⋮ Unnamed Item ⋮ Chang's lemma via Pinsker's inequality ⋮ Finite field models in arithmetic combinatorics -- ten years on ⋮ Fourier bounds and pseudorandom generators for product tests

This page was built for publication: An Entropic Proof of Chang's Inequality