FKN, first proof, rewritten

arxiv(2021)

引用 0|浏览1
暂无评分
摘要
About twenty years ago we wrote a paper, "Boolean Functions whose Fourier Transform is Concentrated on the First Two Levels", \cite{FKN}. In it we offered several proofs of the statement that Boolean functions $f(x_1,x_2,\dots,x_n)$, whose Fourier coefficients are concentrated on the lowest two levels are close to a constant function or to a function of the form $f=x_k$ or $f=1-x_k$. Returning to the paper lately, we noticed that the presentation of the first proof is rather cumbersome, and includes several typos. In this note we rewrite that proof, as a service to the public.
更多
查看译文
关键词
first proof,fkn
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要