FKN Theorem on the biased cube (1311.3179v1)
Abstract: In this note we consider Boolean functions defined on the discrete cube equipped with a biased product probability measure. We prove that if the spectrum of such a function is concentrated on the first two Fourier levels, then the function is close to a certain function of one variable. Moreover, in the symmetric case we prove that if a [-1,1]-valued function defined on the discrete cube is close to a certain affine function, then it is also close to a [-1,1]-valued affine function.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.