Related papers: FKN, first proof, rewritten
In this paper we introduce the study of quantum boolean functions, which are unitary operators f whose square is the identity: f^2 = I. We describe several generalisations of well-known results in the theory of boolean functions, including…
The results presented in this paper are refinements of some results presented in a previous paper. Three such refined results are presented. The first one relaxes one of the basic hypotheses assumed in the previous paper, and thus extends…
A function defined on the Boolean hypercube is $k$-Fourier-sparse if it has at most $k$ nonzero Fourier coefficients. For a function $f: \mathbb{F}_2^n \rightarrow \mathbb{R}$ and parameters $k$ and $d$, we prove a strong upper bound on the…
The aim of this paper is to pursue the investigation of the phase retrieval problem for the fractional Fourier transform $\ff\_\alpha$ started by the second author. We here extend a method of A.E.J.M Janssen to show that there is a…
In this paper, we study lower order terms of the $1$-level density of low-lying zeros of quadratic Hecke L-functions in the Gaussian field. Assuming the Generalized Riemann Hypothesis, our result is valid for even test functions whose…
We consider the problem of testing whether a Boolean function has Fourier degree $\leq k$ or it is $\epsilon$-far from any Boolean function with Fourier degree $\leq k$. We improve the known lower bound of $\Omega(k)$ \cite{BBM11,CGM10}, to…
The Friedgut--Kalai--Naor theorem states that if a Boolean function $f\colon \{0,1\}^n \to \{0,1\}$ is close (in $L^2$-distance) to an affine function $\ell(x_1,...,x_n) = c_0 + \sum_i c_i x_i$, then $f$ is close to a Boolean affine…
We prove an inversion theorem for the Fourier transform defined for normal functions, in the case when such functions are of moderate decrease, and in dimensions 2 and 3. This improves on Carleson's general almost everywhere convergence…
Every Boolean function can be uniquely represented as a multilinear polynomial. The entropy and the total influence are two ways to measure the concentration of its Fourier coefficients, namely the monomial coefficients in this…
The behaviour of the quark coefficient function for the longitudinal structure function F_L in deep-inelastic scattering is investigated for large values of the Bjorken variable x. We combine a highly plausible conjecture on the large-x…
We study sequences of functions of the form F_p^n -> {0,1} for varying n, and define a notion of convergence based on the induced distributions from restricting the functions to a random affine subspace. Using a decomposition theorem and a…
We prove two main results on how arbitrary linear threshold functions $f(x) = \sign(w\cdot x - \theta)$ over the $n$-dimensional Boolean hypercube can be approximated by simple threshold functions. Our first result shows that every…
In the work of Donoho and Stark, they study a manifestation of the uncertainty principle in signal recovery. They conjecture that, for a function with support of bounded size T, the maximum concentration of its Fourier transform in the low…
The approximate degree of a Boolean function $f \colon \{-1, 1\}^n \rightarrow \{-1, 1\}$ is the least degree of a real polynomial that approximates $f$ pointwise to error at most $1/3$. We introduce a generic method for increasing the…
Consider a subset $A$ of $\mathbb{F}_p^n$ and a decomposition of its indicator function as the sum of two bounded functions $1_A=f_1+f_2$. For every family of linear forms, we find the smallest degree of uniformity $k$ such that assuming…
The flux reconstruction (FR) approach offers a flexible framework for describing a range of high-order numerical schemes; including nodal discontinuous Galerkin and spectral difference schemes. This is accomplished through the use of…
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 prove that Boolean functions on $S_{n}$ whose Fourier transform is highly concentrated on the first two irreducible representations of $S_n$, are close to being unions of cosets of point-stabilizers. We use this to give a natural proof…
We study Boolean functions on the $p$-biased hypercube $(\{0,1\}^n,\mu_p^n)$ through the lens of Fourier (spectral) entropy, i.e. the Shannon entropy of the squared $p$-biased Fourier coefficients. Motivated by recent restriction-based…
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…