加载中…
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 , whose Fourier coefficients are concentrated on the lowest two levels are close to a constant function or to a function of the form or . 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.

生成讲解博客的中文版本

生成AI智能校验的中文版本