Related papers: On the Sum of Linear Coefficients of a Boolean Val…

We study sums of the shape $\sum_{n \leqslant x} f \left( \lfloor x/n \rfloor \right)$ where $f$ is either the von Mangoldt function or the Dirichlet-Piltz divisor functions. We improve previous estimates when $f = \Lambda$ and $f = \tau$,…

A simple way to generate a Boolean function is to take the sign of a real polynomial in $n$ variables. Such Boolean functions are called polynomial threshold functions. How many low-degree polynomial threshold functions are there? The…

We study the concentration of the distribution of an additive function, when the sequence of prime values of $f$ decays fast and has good spacing properties. In particular, we prove a conjecture by Erdos and Katai on the concentration of…

The finite n-th polylogarithm li_n(z) in Z/p[z] is defined as the sum on k from 1 to p-1 of z^k/k^n. We state and prove the following theorem. Let Li_k:C_p to C_p be the p-adic polylogarithms defined by Coleman. Then a certain linear…

In the process of proving a sharpened form of G\r{a}rding's inequality, Fefferman & Phong demonstrated that every non-negative function $f\in C^{3,1}(\mathbb{R}^n)$ can be written as a finite sum of squares of functions in…

Let $f$ be a holomorphic or Maass cusp forms for $ \rm SL_2(\mathbb{Z})$ with normalized Fourier coefficients $\lambda_f(n)$ and \bna r_{\ell}(n)=\#\left\{(n_1,\cdots,n_{\ell})\in \mathbb{Z}^2:n_1^2+\cdots+n_{\ell}^2=n\right\}. \ena Let…

A function $f:\mathbb{Z}_n \to \mathbb{C}$ can be represented as a linear combination $f(x)=\sum_{\alpha \in \mathbb{Z}_n}\widehat{f}(\alpha) \chi_{\alpha,n}(x)$ where $\widehat{f}$ is the (discrete) Fourier transform of $f$. Clearly, the…

We prove new exact formulas for the generalized sum-of-divisors functions, $\sigma_{\alpha}(x) := \sum_{d|x} d^{\alpha}$. The formulas for $\sigma_{\alpha}(x)$ when $\alpha \in \mathbb{C}$ is fixed and $x \geq 1$ involves a finite sum over…

Let $\varphi$ be a plurisubharmonic function on a pseudoconvex domain $D \subset \mathbb C^n$. We show that there exists a nonzero holomorphic function $f$ on $D$ such that some local mean value of $\varphi$ with logarithmic additional…

We consider a generalization of the "Hadamard quotient theorem" of Pourchet and van der Poorten. A particular case of our conjecture states that if $f := \sum_{n \geq 0} a(n)x^n$ and $g := \sum_{n \geq 0} b(n)x^n$ represent, respectively,…

Let f:{-1,1}^n -> R be a real function on the hypercube, given by its discrete Fourier expansion, or, equivalently, represented as a multilinear polynomial. We say that it is Boolean if its image is in {-1,1}. We show that every function on…

We study the triple convolution sum of the generalised divisor functions $$\sum_{n\leq x} d_k(n+h)d_l(n)d_m(n-h),$$ where $h \le x^{1-\epsilon}$ for any $\epsilon>0$ and $d_k(n)$ denotes the generalised divisor function which counts the…

In \cite{js2006}, Jonasson and Steif conjectured that no non-degenerate sequence of transitive Boolean functions $ (f_n)_{n \geq 1}$ with $ \lim_{n \to \infty} I(f_n)= \infty $ could be tame (with respect to some $ (p_n)_{n \geq 1} $). In a…

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…

Let $B$ be a ball in ${\mathbb R}^2$. For $j=1,2,3$ let $\varphi_j:B\to{\mathbb R}^1$ be real analytic submersions, and let $a_j$ be real analytic coefficient functions. To any $\varepsilon>0$ and any Lebesgue measurable functions…

According to a celebrated result by L\"owner, a real-valued function $f$ is operator monotone if and only if its L\"owner matrix, which is the matrix of divided differences $L_f=(\frac{f(x_i)-f(x_j)}{x_i-x_j})_{i,j=1}^N$, is positive…

In this paper we study the separation between two complexity measures: the degree of a Boolean function as a polynomial over the reals and its block sensitivity. We show that separation between these two measures can be improved from $…

Let $\{U_n\}$ be given by $U_0=1$ and $U_n=-2\sum_{k=1}^{[n/2]} \b n{2k}U_{n-2k}\ (n\ge 1)$, where $[\cdot]$ is the greatest integer function. In the paper we present a summation formula and several congruences involving $\{U_n\}$.

We give the first non-trivial upper bounds on the average sensitivity and noise sensitivity of polynomial threshold functions. More specifically, for a Boolean function f on n variables equal to the sign of a real, multivariate polynomial…

Let $U_{k,N}$ denote the Boolean function which takes as input $k$ strings of $N$ bits each, representing $k$ numbers $a^{(1)},\dots,a^{(k)}$ in $\{0,1,\dots,2^{N}-1\}$, and outputs 1 if and only if $a^{(1)} + \cdots + a^{(k)} \geq 2^N.$…