聖塔非研究所

摘要 Chang's lemma is a useful tool in additive combin

2014 · 已發表論文 · 更新 2026/08/30 下午12:48

摘要 Chang's lemma is a useful tool in additive combinatorics and the analysis of Boolean functions. Here we give an elementary proof using 熵. We obtain a tight constant and give a slight impr…

SFI 頁面 DOI

本頁只刊出中文翻譯與中文說明；英文原文請見下方原文連結。

原文連結

SFI 頁面
DOI

論文資訊

類型：已發表論文
日期：2014

摘要

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

※ 此為已發表論文，全文需透過期刊付費取得