An Entropic Proof of Chang's Inequality
classification
💻 cs.CC
math.CO
keywords
changgiveproofadditiveanalysisbiasedbooleancase
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.