Title:
An Entropic Proof of Chang’s Inequality
Author(s):
Russell Impagliazzo, Cristopher Moore, Alexander Russell
Paper #:
13-05-018
Date:
May 7, 2013
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.
Facebook
Twitter
LinkedIn
Email Newsletter
SFI News Feed
Google+
YouTube
iTunes U