Related papers: On the Analysis of Boolean Functions and Fourier-E…
We study functions on the infinite-dimensional Hamming cube $\{-1,1\}^\infty$, in particular Boolean functions into $\{-1,1\}$, generalising results on analysis of Boolean functions on $\{-1,1\}^n$ for $n\in\mathbb{N}$. The notion of noise…
The threshold degree of a Boolean function f:{0,1}^n->{-1,+1} is the least degree of a real polynomial p such that f(x)=sgn p(x). We construct two halfspaces on {0,1}^n whose intersection has threshold degree Theta(sqrt n), an exponential…
Indicator functions mentioned in the title are constructed on an arbitrary nondiscrete locally compact Abelian group of finite dimension. Moreover, they can be obtained by small perturbation from any indicator function fixed beforehand. In…
We introduce a new notion of influence for symmetric convex sets over Gaussian space, which we term "convex influence". We show that this new notion of influence shares many of the familiar properties of influences of variables for monotone…
We prove that, to compute a Boolean function $f$ on $N$ variables with error probability $\epsilon$, any quantum black-box algorithm has to query at least $\frac{1 - 2\sqrt{\epsilon}}{2} \rho_f N = \frac{1 - 2\sqrt{\epsilon}}{2} \bar{S}_f$…
This paper studies the hazard-free formula complexity of Boolean functions. Our first result shows that unate functions are the only Boolean functions for which the monotone formula complexity of the hazard-derivative equals the hazard-free…
Given a Boolean function f, the quantity ess(f) denotes the largest set of assignments that falsify f, no two of which falsify a common implicate of f. Although ess(f)$ is clearly a lower bound on cnf_size(f) (the minimum number of clauses…
Let $\tau_k$ be the $k$-fold divisor function. By constructing an approximant of $\tau_k$, denoted as $\tau_k^*$, which is a normalized truncation of the $k$-fold divisor function, we prove that when $\exp\left(C\log^{1/2}X(\log\log…
Given a bounded class of functions G and independent random variables X1, . . . , Xn, we provide an upper bound for the expectation of the supremum of the empirical process over elements of G having a small variance. Our bound applies in…
The Frank-Wolfe algorithm has seen a resurgence in popularity due to its ability to efficiently solve constrained optimization problems in machine learning and high-dimensional statistics. As such, there is much interest in establishing…
Using the AdS/CFT correspondence, we examine entanglement entropy for a boundary theory deformed by a relevant operator and establish two results. The first is that if there is a contribution which is logarithmic in the UV cut-off, then the…
The paper focuses on the behaviour of unimodular Fourier multipliers with exponential growth in the context of weighted $L^p$-spaces. Our main result shows that much of the general theory of multipliers is approachable through the theory of…
In this report, we show that all n-variable Boolean function can be represented as polynomial threshold functions (PTF) with at most $0.75 \times 2^n$ non-zero integer coefficients and give an upper bound on the absolute value of these…
The ability of information processing in biologically motivated Boolean networks is of interest in recent information theoretic research. One measure to quantify this ability is the well known mutual information. Using Fourier analysis we…
We study parity decision trees for Boolean functions. The motivation of our study is the log-rank conjecture for XOR functions and its connection to Fourier analysis and parity decision tree complexity. Let f be a Boolean function with…
A novel, non-trivial, probabilistic upper bound on the entropy of an unknown one-dimensional distribution, given the support of the distribution and a sample from that distribution, is presented. No knowledge beyond the support of the…
We show (almost) separation between certain important classes of Boolean functions. The technique that we use is to show that the total influence of functions in one class is less than the total influence of functions in the other class. In…
Fourier analysis on the discrete hypercubes $\{-1,1\}^n$ has found numerous applications in learning theory. A recent breakthrough involves the use of a classical result from Fourier analysis, the Bohnenblust--Hille inequality, in the…
We study the most-informative Boolean function conjecture using a differential equation approach. This leads to a formulation of a functional inequality on finite-dimensional random variables. We also develop a similar inequality in the…
Let $f$ be an $E$-function (in Siegel's sense) not of the form $e^{\beta z}$, $\beta \in \overline{\mathbb{Q}}$, and let $\log$ denote any fixed determination of the complex logarithm. We first prove that there exists a finite set $S(f)$…