相关论文: Boolean functions with small spectral norm

We give improved and almost optimal testers for several classes of Boolean functions on $n$ inputs that have concise representation in the uniform and distribution-free model. Classes, such as $k$-junta, $k$-linear functions, $s$-term DNF,…

An extremal point of a positive threshold Boolean function $f$ is either a maximal zero or a minimal one. It is known that if $f$ depends on all its variables, then the set of its extremal points completely specifies $f$ within the universe…

This paper is concerned with the spectral characteristics of quaternionic positive definite functions on the real line. We generalize the Stone's theorem to the case of a right quaternionic linear one-parameter unitary group via two…

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…

In this paper we compute the Fourier spectra of some recently discovered binomial APN functions. One consequence of this is the determination of the nonlinearity of the functions, which measures their resistance to linear cryptanalysis.…

In this paper, we prove that most of the boolean functions, $f : \{-1,1\}^n \rightarrow \{-1,1\}$ satisfy the Fourier Entropy Influence (FEI) Conjecture due to Friedgut and Kalai (Proc. AMS'96). The conjecture says that the Entropy of a…

A conjecture of Bombieri states that the coefficients of a normalized univalent function $f$ should satisfy $$ \liminf_{f\to K} \frac{n-{\rm Re\,}a_n}{m-{\rm Re\,}a_m} = \min_{t\in{\mathbb R}} \, \frac{n\sin t -\sin(nt)}{m\sin t -\sin(mt)},…

An infinite family of Boolean polynomials which correspond to the discrete average maps, defined in [2], is constructed and their algebraic and combinatorial properties are investigated. They turn out to be balanced, and some recurrence…

Smoothness of a function $f:{\mathbb R}^n\to {\mathbb R}$ can be measured in terms of the rate of convergence of $f\ast\rho_\varepsilon$ to $f$, where $\rho$ is an appropriate mollifier. In the framework of fractional Sobolev spaces, we…

We provide an introduction of some basic facts of uniformly almost periodic functions, such as Fourier series representations. A result is then proved about Fourier coefficients which is a generalization of the purely periodic case. We then…

A natural measure of smoothness of a Boolean function is its sensitivity (the largest number of Hamming neighbors of a point which differ from it in function value). The structure of smooth or equivalently low-sensitivity functions is still…

The Fourier-Entropy Influence (FEI) Conjecture states that for any Boolean function $f:\{+1,-1\}^n \to \{+1,-1\}$, the Fourier entropy of $f$ is at most its influence up to a universal constant factor. While the FEI conjecture has been…

This paper considers the problem of approximating a Boolean function $f$ using another Boolean function from a specified class. Two classes of approximating functions are considered: $k$-juntas, and linear Boolean functions. The $n$ input…

This paper discusses a generalization of spectral representations related to convex one-homogeneous regularization functionals, e.g. total variation or $\ell^1$-norms. Those functionals serve as a substitute for a Hilbert space structure…

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…

We give an alternative proof of a conjecture of Bollob\'as, Brightwell and Leader, first proved by Peter Allen, stating that the number of boolean functions definable by 2-SAT formulae is $(1+o(1))2^{\binom{n+1}{2}}$. One step in the proof…

A Boolean function $f({\vec x})$ is sensitive to bit $x_i$ if there is at least one input vector $\vec x$ and one bit $x_i$ in $\vec x$, such that changing $x_i$ changes $f$. A function has sensitivity $s$ if among all input vectors, the…

The Fourier Entropy-Influence (FEI) conjecture of Friedgut and Kalai [FK96] seeks to relate two fundamental measures of Boolean function complexity: it states that $H[f] \leq C Inf[f]$ holds for every Boolean function $f$, where $H[f]$…

For each $a \in \mathbb{R}$, we define a Borel function $f_a : \mathbb{R} \to \mathbb{R}$ which encodes $a$ in a certain sense. We show that for each Borel $g : \mathbb{R} \to \mathbb{R}$, $f_a \cap g = \emptyset$ implies $a \in…

We present a regularity lemma for Boolean functions $f:\{-1,1\}^n \to \{-1,1\}$ based on noisy influence, a measure of how locally correlated $f$ is with each input bit. We provide an application of the regularity lemma to weaken the…