Related papers: Boolean functions with small spectral norm
We prove that Boolean functions on $S_n$, whose Fourier transform is highly concentrated on irreducible representations indexed by partitions of $n$ whose largest part has size at least $n-t$, are close to being unions of cosets of…
The approximate degree of a Boolean function $f(x_{1},x_{2},\ldots,x_{n})$ is the minimum degree of a real polynomial that approximates $f$ pointwise within $1/3$. Upper bounds on approximate degree have a variety of applications in…
We consider non oscillatory functions and prove an everywhere Fourier Inversion Theorem for functions of very moderate decrease. The proofs rely on some ideas in nonstandard analysis.
We compute the spectral form of the Koopman representation induced by a natural boolean action of $L^0(\lambda, {\mathbb T})$ identified earlier by the authors. Our computation establishes the sharpness of the constraints on spectral forms…
We demonstrate a phenomenon of condensation of the Fourier transform $\widehat{f}$ of a function $f$ defined on the real line $\mathbb{R}$ which decreases rapidly on one half of the line. For instance, we prove that if $f$ is…
We derive integral representations in terms of the Macdonald functions for the square modulus $s\mapsto | \Gamma ( a + i s ) |^2$ of the Gamma function and its Fourier transform when $a<0$ and $a\not= -1,-2,\ldots $, generalizing known…
A classical theorem of Nisan and Szegedy says that a boolean function with degree $d$ as a real polynomial depends on at most $d2^{d-1}$ of its variables. In recent work by Chiarelli, Hatami and Saks, this upper bound was improved to $C…
A Boolean function $f:\{0,1\}^n \to \{0,1\}$ is said to be noise sensitive if inserting a small random error in its argument makes the value of the function almost unpredictable. Benjamini, Kalai and Schramm showed that if the sum of…
It has previously been an open problem whether all Boolean submodular functions can be decomposed into a sum of binary submodular functions over a possibly larger set of variables. This problem has been considered within several different…
In this paper we characterize (octal) bent generalized Boolean functions defined on $\BBZ_2^n$ with values in $\BBZ_8$. Moreover, we propose several constructions of such generalized bent functions for both $n$ even and $n$ odd.
By using some basic calculus of multiple integration, we provide an alternative expression of the integral $$ \int_{]a,b[^n} f(\mathbf{x},\min x_i,\max x_i) d\mathbf{x}, $$ in which the minimum and the maximum are replaced with two single…
We investigate the max min of the algebraic degree and the nonlinearity of a Boolean function in $n$ variables when restricted to a $k$-dimensional affine subspace of $\mathbb{F}_2^n$. Previous authors have focused on the cases when the max…
Voting is a commonly applied method for the aggregation of the preferences of multiple agents into a joint decision. If preferences are binary, i.e., "yes" and "no", every voting system can be described by a (monotone) Boolean function…
Let $f$ be a half-integral weight cusp form of level $4N$ for odd and squarefree $N$ and let $a(n)$ denote its $n^{\rm th}$ normalized Fourier coefficient. Assuming that all the coefficients $a(n)$ are real, we study the sign of $a(n)$ when…
Let $\{f_i:\mathbb{F}_p^i \to \{0,1\}\}$ be a sequence of functions, where $p$ is a fixed prime and $\mathbb{F}_p$ is the finite field of order $p$. The limit of the sequence can be syntactically defined using the notion of ultralimit.…
We define an enumerative function F(n,k,P,m) which is a generalization of binomial coefficients. Special cases of this function are also power function, factorials, rising factorials and falling factorials. The first section of the paper is…
We derive an identity for certain linear combinations of polylogarithm functions with negative exponents, which implies relations for linear combinations of Eulerian numbers. The coefficients of our linear combinations are related to…
For an analytic and univalent function $f$ in the unit disk $\mathbb{D}:=\{z\in\mathbb{C}:|z|<1\}$ with the normalization $f(0)=0=f'(0)-1$, the logarithmic coefficients $\gamma_n$ are defined by $\log \frac{f(z)}{z}= 2\sum_{n=1}^{\infty}…
The logarithmic coefficients $\gamma_n$ of an analytic and univalent function $f$ in the unit disk $\mathbb{D}=\{z\in\mathbb{C}:|z|<1\}$ with the normalization $f(0)=0=f'(0)-1$ are defined by $\log \frac{f(z)}{z}= 2\sum_{n=1}^{\infty}…
There is a class of physical filtration processes where the input is adequately modeled by a continuous periodic function f (x) of bounded variation over its period, and the output depends only on certain harmonics of the Fourier expansion…