An Entropic Proof of Chang's Inequality

2012/05/01 by Russell Impagliazzo, Cristopher Moore, Impagliazzo, Russell +3 · 1 citation
Computer Science · Mathematics · #Advanced Algebra and Logic #Combinatorics (math.CO) #Computational Complexity (cs.CC) #FOS: Computer and information sciences #FOS: Mathematics #cs.CC #math.CO

paper · pdf · doi:10.48550/arxiv.1205.0263

openalex publication_date 2012/05/01 · arxiv created 2012/05/16 · arxiv updated 2012/05/17 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

Chang's lemma is a useful tool in additive combinatorics and the analysis of Boolean functions. Here we give an elementary proof using entropy. The constant we obtain is tight, and we give a slight improvement in the case where the variables are highly biased.

Cited by

• Fourier sparsity, spectral norm, and the Log-rank conjecture

Related

• Exploring the entropic region
• Entropy versions of additive inequalities
• A generalization of Costa's Entropy Power Inequality
• Information Inequalities via Ideas from Additive Combinatorics
• A Useful Inequality for the Binary Entropy Function