Related papers: On the maximal L1 influence of real-valued boolean…

We give a sharp sufficient condition on the distribution function, $|\{x\in \Omega :\,p(x)\leq 1+\lambda\}|$, $\lambda>0$, of the exponent function $p(\cdot): \Omega \to [1,\infty)$ that implies the embedding of the variable Lebesgue space…

It is known that a positive Boolean function f depending on n variables has at least n + 1 extremal points, i.e. minimal ones and maximal zeros. We show that f has exactly n + 1 extremal points if and only if it is linear read-once. The…

Let $\mathcal{P}$ be the set of the primes. We consider a class of random multiplicative functions $f$ supported on the squarefree integers, such that $\{f(p)\}_{p\in\mathcal{P}}$ form a sequence of $\pm1$ valued independent random…

We study the volatility of the output of a Boolean function when the input bits undergo a natural dynamics. For $n = 1,2,\ldots$, let $f_n:\{0,1\}^{m_n} \ra \{0,1\}$ be a Boolean function and $X^{(n)}(t)=(X_1(t),\ldots,X_{m_n}(t))_{t \in…

In a recent paper by Jonasson and Steif, definitions to describe the volatility of sequences of Boolean functions, \( f_n \colon \{ -1,1 \}^n \to \{ -1,1 \} \) were introduced. We continue their study of how these definitions relate to…

In functional analysis, there are different notions of limit for a bounded sequence of $L^1$ functions. Besides the pointwise limit, that does not always exist, the behaviour of a bounded sequence of $L^1$ functions can be described in…

Assuming that $S$ is the space of functions of regular variation, $\omega\in S$, $0< p<\infty$, a function $f$ holomorphic in $B^n$ is said to be of Besov space $B_p(\omega)$ if $$\|f\|^p_{B_p(\omega )}=\int_{B^n}…

We pursue a systematic study of the following problem. Let f:{0,1}^n -> {0,1} be a (usually monotone) Boolean function whose behaviour is well understood when the input bits are identically independently distributed. What can be said about…

We establish bounds for the covariance of a large class of functions of infinite variance stable random variables, including unbounded functions such as the power function and the logarithm. These bounds involve measures of dependence…

We prove that every bounded function $f:\{-1,1\}^n\to[-1,1]$ of degree at most $d$ can be learned with $L_2$-accuracy $\varepsilon$ and confidence $1-\delta$ from $\log(\tfrac{n}{\delta})\,\varepsilon^{-d-1} C^{d^{3/2}\sqrt{\log d}}$ random…

We characterize the power of constant-depth Boolean circuits in generating uniform symmetric distributions. Let $f\colon\{0,1\}^m\to\{0,1\}^n$ be a Boolean function where each output bit of $f$ depends only on $O(1)$ input bits. Assume the…

In this paper, we study classes of Boolean functions that are testable with $O(\psi+1/\epsilon)$ queries, where $\psi$ depends on the parameters of the class (e.g., the number of terms, the number of relevant variables, etc.) but not on the…

A Boolean function of n bits is balanced if it takes the value 1 with probability 1/2. We exhibit a balanced Boolean function with a randomized evaluation procedure (with probability 0 of making a mistake) so that on uniformly random…

Let X_1,..., X_n be independent Bernoulli random variables and $f$ a function on {0,1}^n. In the well-known paper (Talagrand1994) Talagrand gave an upper bound for the variance of f in terms of the individual influences of the X_i's. This…

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 $\Omega(n)$ denote the number of prime factors of a positive integer $n$ counted with multiplicities. We show that for any bounded functions $a,b\colon\mathbb{N}\to\mathbb{C}$, $$\frac{1}{\log{N}}\sum_{n=1}^N…

We show that a function $ f $ of bounded variation satisfies $$ \Var Mf \leq C \Var f $$ where $ Mf $ is the centered Hardy-Littlewood maximal function of $ f $. Consequently, the operator $ f \mapsto (Mf)' $ is bounded from $ W^{1,1}(R) $…

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…

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…

For $V : \mathbb{R}^d \to \mathbb{R}$ coercive, we study the convergence rate for the $L^1$-distance of the empiric minimizer, which is the true minimum of the function $V$ sampled with noise with a finite number $n$ of samples, to the…