Related papers: FKN Theorem on the biased cube

We prove that a balanced Boolean function on $S_{n}$ whose Fourier transform is highly concentrated on the first two irreducible representations of $S_{n}$, is close in structure to a dictatorship, a function which is determined by the…

We present a straightforward discretization of the Bessel functions $J_n(x)$ to discrete counterparts $B^{(N)}_n(x_m)$, of $N$ integer orders $n$ on $N$ integer points $x_m \equiv m$, that we call discrete Bessel functions. These are built…

We study the Fourier spectrum of functions $f\colon \{0,1\}^{mk} \to \{-1,0,1\}$ which can be written as a product of $k$ Boolean functions $f_i$ on disjoint $m$-bit inputs. We prove that for every positive integer $d$, \[ \sum_{S \subseteq…

A one to one correspondence between regular generalized bent functions from $\F_2^n$ to $\Z_{2^m},$ and $m-$tuples of Boolean bent functions is established. This correspondence maps self-dual (resp. anti-self-dual) generalized bent…

We associate to each Boolean function a polynomial whose evaluations represents the distances from all possible Boolean affine functions. Both determining the coefficients of this polynomial from the truth table of the Boolean function and…

The construction of a multiresolution analysis starts with specification of a scale function. The Fourier transform of this function is defined by an infinite product. The convergence of this product is usually discussed in the context of…

Let $A$ be a subset of a finite abelian group such that $A$ has a small difference set $A-A$ and the density of $A$ is small. We prove that, counter--intuitively, the smallness (in terms of $|A-A|$) of the Fourier coefficients of $A$…

The paper develops a method for discrete computational Fourier analysis of functions defined on quasicrystals and other almost periodic sets. A key point is to build the analysis around the emerging theory of quasicrystals and diffraction…

A nearest neighbor representation of a Boolean function is a set of positive and negative prototypes in $R^n$ such that the function has value 1 on an input iff the closest prototype is positive. For $k$-nearest neighbor representation the…

Let $\sigma_i$, $i=1,2,3$, denote positive Borel measures on $\mathbb{R}^n$, let $\mathcal{D}$ denote the usual collection of dyadic cubes in $\mathbb{R}^n$ and let $K:\,\mathcal{D}\to[0,\infty)$ be a map. In this paper we give a…

Brouwer's fixed point theorem states that any continuous function from a closed $n$-dimensional ball to itself has a fixed point. In 1961, Klee showed that if such a function has discontinuities that are bounded, then it has a point that is…

In this paper we study dual bases functions in subspaces. These are bases which are dual to functionals on larger linear space. Our goal is construct and derive properties of certain bases obtained from the construction, with primary focus…

Fourier analysis on the Boolean hypercube is fundamentally defined as the orthogonal decomposition of the space of pseudo-Boolean functions with respect to the uniform probability measure. In this work, we propose an ANOVA-based…

A theorem of Hoischen states that given a positive continuous function $\varepsilon:\mathbb{R}\to\mathbb{R}$, an integer $n\geq 0$, and a closed discrete set $E\subseteq\mathbb{R}$, any $C^n$ function $f:\mathbb{R}\to\mathbb{R}$ can be…

We ask whether most Boolean functions are determined by their low frequencies. We show a partial result: for almost every function $f: \{-1,1\}^p \to \{-1,1\}$ there exists a function $f': \{-1,1\}^p \to (-1,1)$ that has the same…

A Boolean function $g$ is said to be an optimal predictor for another Boolean function $f$, if it minimizes the probability that $f(X^{n})\neq g(Y^{n})$ among all functions, where $X^{n}$ is uniform over the Hamming cube and $Y^{n}$ is…

We establish a precise relationship between spherical harmonics and Fourier basis functions over a hypercube randomly embedded in the sphere. In particular, we give a bound on the expected Boolean noise sensitivity of a randomly rotated…

We characterise the unbiasedness of the score function, viewed as an inference function for a class of finite mixture models. The models studied represent the situation where there is a stratification of the observations in a finite number…

We give a new fast method for evaluating sprectral approximations of nonlinear polynomial functionals. We prove that the new algorithm is convergent if the functions considered are smooth enough, under a general assumption on the spectral…

Many researchers have studied symmetry properties of various Boolean functions. A class of Boolean functions, called nested canalyzing functions (NCFs), has been used to model certain biological phenomena. We identify some interesting…