Related papers: FKN Theorem on the biased cube

It is shown that monotone Boolean functions on the Boolean cube capture the expected number of primes, under he usual identification by binary expansion. This answers a question posed by G.Kalai.

Associated to any affine space A endowed with a metric structure of arbitrary signature we consider the space of affine functionals operating on the space of quadratic functions of A. On this functional space we characterize a symmetric…

Let $F$ be a quadratic APN function of $n$ variables. The associated Boolean function $\gamma_F$ in $2n$ variables ($\gamma_F(a,b)=1$ if $a\neq{\bf 0}$ and equation $F(x)+F(x+a)=b$ has solutions) has the form $\gamma_F(a,b) = \Phi_F(a)…

If f is a smooth function on a Hodge manifold, we construct a canonical sequence of real algebraic functions that converge to f in the smooth topology. The definition of of the approximants is inspired by Berezin-Toeplitz quantization. The…

The probabilistic degree of a Boolean function $f:\{0,1\}^n\rightarrow \{0,1\}$ is defined to be the smallest $d$ such that there is a random polynomial $\mathbf{P}$ of degree at most $d$ that agrees with $f$ at each point with high…

The Bonami-Beckner hypercontractive inequality is a powerful tool in Fourier analysis of real-valued functions on the Boolean cube. In this paper we present a version of this inequality for matrix-valued functions on the Boolean cube. Its…

It is a well-known fact that Riemann Hypothesis will follows if the function identically equal to -1 can be arbitrarily approximated in the norm $\norma{.}$ of $L^{2}([0,1],dx)$ by functions of the form $f(x)=\sum_{k=1}^{n}a_{k}…

We provide two sufficient and necessary conditions to characterize any $n$-bit partial Boolean function with exact quantum 1-query complexity. Using the first characterization, we present all $n$-bit partial Boolean functions that depend on…

Bochner's theorem gives the necessary and sufficient conditions on a function such that its Fourier transform corresponds to a true probability density function. In the Wigner phase space picture, quantum Bochner's theorem gives the…

We study the computational power of polynomial threshold functions, that is, threshold functions of real polynomials over the boolean cube. We provide two new results bounding the computational power of this model. Our first result shows…

We show that if $f\colon S_n \to \{0,1\}$ is $\epsilon$-close to linear in $L_2$ and $\mathbb{E}[f] \leq 1/2$ then $f$ is $O(\epsilon)$-close to a union of "mostly disjoint" cosets, and moreover this is sharp: any such union is close to…

We study whether a uniformly random Boolean function $f : \{-1,1\}^p \to \{-1,1\}$ is determined by its Walsh--Fourier coefficients of degree at most $d$. We show that the threshold lies at $p/2$ up to an $O(\sqrt{p \log p})$ window: if \[…

We prove that if a multiple trigonometric series is spherically Abel summable everywhere to an everywhere finite function $f(x)$ which is bounded below by an integrable function, then the series is the Fourier series of $f(x)$ if the…

We prove the Courtade-Kumar conjecture, for certain classes of $n$-dimensional Boolean functions, $\forall n\geq 2$ and for all values of the error probability of the binary symmetric channel, $\forall 0 \leq p \leq \frac{1}{2}$. Let…

Let $\mathcal{F}_{n}^*$ be the set of Boolean functions depending on all $n$ variables. We prove that for any $f\in \mathcal{F}_{n}^*$, $f|_{x_i=0}$ or $f|_{x_i=1}$ depends on the remaining $n-1$ variables, for some variable $x_i$. This…

We consider functions $f$ of two real variables, given as trigonometric functions over a finite set $F$ of frequencies. This set is assumed to be closed under rotations in the frequency plane of angle $\frac{2k\pi}{M}$ for some integer $M$.…

Let $(X,\|\cdot\|_X)$ be a Banach space. The purpose of this article is to systematically investigate dimension independent properties of vector valued functions $f:\{-1,1\}^n\to X$ on the Hamming cube whose spectrum is bounded above or…

This paper discusses the theory and application of learning Boolean functions that are concentrated in the Fourier domain. We first estimate the VC dimension of this function class in order to establish a small sample complexity of learning…

We study how well functions over the boolean hypercube of the form $f_k(x)=(|x|-k)(|x|-k-1)$ can be approximated by sums of squares of low-degree polynomials, obtaining good bounds for the case of approximation in $\ell_{\infty}$-norm as…

Generalisations of the bent property of a boolean function are presented, by proposing spectral analysis with respect to a well-chosen set of local unitary transforms. Quadratic boolean functions are related to simple graphs and it is shown…