pith. sign in

arxiv: 1311.3179 · v1 · pith:DGN4PYZHnew · submitted 2013-11-13 · 🧮 math.CO

FKN Theorem on the biased cube

classification 🧮 math.CO
keywords functionclosecubeaffinebiasedcertaindefineddiscrete
0
0 comments X
read the original 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.

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.