Related papers: An Improved Upper Bound for the Most Informative B…
This paper develops upper and lower bounds for the probability of Boolean functions by treating multiple occurrences of variables as independent and assigning them new individual probabilities. We call this approach dissociation and give an…
Although there is an extensive literature on the upper bound for cumulative standard normal distribution, there are relatively not sharp for all values of the interested argument x. The aim of this paper is to establish a sharp upper bound…
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…
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…
In this paper, we establish a new inequality tying together the effective length and the maximum correlation between the outputs of an arbitrary pair of Boolean functions which operate on two sequences of correlated random variables. We…
In this paper, we establish a new bound tying together the effective length and the maximum correlation between the outputs of an arbitrary pair of Boolean functions which operate on two sequences of correlated random variables. We derive a…
We improve both upper and lower bounds for the distribution-free testing of monotone conjunctions. Given oracle access to an unknown Boolean function $f:\{0,1\}^n \rightarrow \{0,1\}$ and sampling oracle access to an unknown distribution…
We suggest an upper bound on binomial coefficients that holds over the entire parameter range and whose form repeats the form of the de Moivre-Laplace approximation of the symmetric binomial distribution. Using the bound, we estimate the…
It is well known that if a submartingale $X$ is bounded then the increasing predictable process $Y$ and the martingale $M$ from the Doob decomposition $% X=Y+M$ can be unbounded. In this paper for some classes of increasing convex functions…
Consider finite sequences $X_{[1,n]}=X_1\dots X_n$ and $Y_{[1,n]}=Y_1\dots Y_n$ of length $n$, consisting of i.i.d.\ samples of random letters from a finite alphabet, and let $S$ and $T$ be chosen i.i.d.\ randomly from the unit ball in the…
A Boolean function $g$ is said to be an optimal predictor for another Boolean function $f$, if it minimizes the probability that $f(X^{n})\neq g(Y^{n})$ among all functions, where $X^{n}$ is uniform over the Hamming cube and $Y^{n}$ is…
Let $\lambda$ denote the Liouville function. We prove that $$\sum_{X \leq x < 2X} \sup_{\alpha \in \mathbb{R}/\mathbb{Z}} \bigg\lvert\!\sum_{x \leq n < x+H} \lambda(n) e(n\alpha)\bigg\rvert = o(HX)$$ as $X\to \infty$, in the regime $H =…
The mutual information between two jointly distributed random variables $X$ and $Y$ is a functional of the joint distribution $P_{XY},$ which is sometimes difficult to handle or estimate. A coarser description of the statistical behavior of…
Recently, Gilmer proved the first constant lower bound for the union-closed sets conjecture via an information-theoretic argument. The heart of the argument is an entropic inequality involving the OR function of two i.i.d.\ binary vectors,…
We present a new lower bound for Euler's beta function, $B(x,y)$, which states that the inequality \begin{equation*} B(x,y)>\frac{x+y}{xy}\left(1-\frac{2xy}{x+y+1}\right) \end{equation*} holds on $(0,1]\times(0,1]$, which improves a lower…
The logarithm of the number of binary n-variable bent functions is asymptotically less than $11(2^n)/32$ as n tends to infinity. Keywords: boolean function, Walsh--Hadamard transform, plateaued function, bent function, upper bound
This paper develops upper and lower bounds for the probability of Boolean expressions by treating multiple occurrences of variables as independent and assigning them new individual probabilities. Our technique generalizes and extends the…
The problem of distributed function computation is studied, where functions to be computed is not necessarily symbol-wise. A new method to derive a converse bound for distributed computing is proposed; from the structure of functions to be…
It is shown that the counting function of n Boolean variables can be implemented with the formulae of size O(n^3.06) over the basis of all 2-input Boolean functions and of size O(n^4.54) over the standard basis. The same bounds follow for…
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…