Related papers: A Lower Bound for the Fourier Entropy of Boolean F…

Consider a monotone Boolean function $f:\{0,1\}^n\to\{0,1\}$ and the canonical monotone coupling $\{\eta_p:p\in[0,1]\}$ of an element in $\{0,1\}^n$ chosen according to product measure with intensity $p\in[0,1]$. The random point…

Dependence among marginally constrained observations can break a finite-sample barrier. To formalize this phenomenon, we introduce the \emph{minimum list entropy coupling} $H(P\|Q_1,\dots,Q_m)$, the minimum conditional entropy…

Fourier restriction theorems, whose study had been initiated by E.M. Stein, usually describe a family of a priori estimates of the L^q-norm of the restriction of the Fourier transform of a function f in L^p (say, on Euclidean space) to a…

Shannon entropy is widely used to quantify the uncertainty of discrete random variables. But when normalized to the unit interval, as is often done in practice, it no longer conveys the alphabet sizes of the random variables being studied.…

We study Fourier-sparse Boolean functions over general finite Abelian groups. A Boolean function $f : G \to \{-1,+1\}$ is $s$-sparse if it has at most $s$ non-zero Fourier coefficients. We introduce a general notion of granularity of…

When two independent analog signals, X and Y are added together giving Z=X+Y, the entropy of Z, H(Z), is not a simple function of the entropies H(X) and H(Y), but rather depends on the details of X and Y's distributions. Nevertheless, the…

In this paper we remark that Shannon entropy can be expressed as a function of the self-information (i.e. the logarithm) and the inverse of the Lambert $W$ function. It means that we consider that Shannon entropy has the trace form: $-k…

Consider a family of Boolean models, indexed by integers $n \ge 1$, where the $n$-th model features a Poisson point process in ${\mathbb{R}}^n$ of intensity $e^{n \rho_n}$ with $\rho_n \to \rho$ as $n \to \infty$, and balls of independent…

Representations of Boolean functions by real polynomials play an important role in complexity theory. Typically, one is interested in the least degree of a polynomial p(x_1,...,x_n) that approximates or sign-represents a given Boolean…

Two new information-theoretic methods are introduced for establishing Poisson approximation inequalities. First, using only elementary information-theoretic techniques it is shown that, when $S_n=\sum_{i=1}^nX_i$ is the sum of the (possibly…

We obtain some sharp $L^p$ weighted Fourier restriction estimates of the form $\|Ef\|_{L^p(B^{n+1}(0,R),Hdx)} \lessapprox R^{\beta}\|f\|_2$, where $E$ is the Fourier extension operator over the truncated paraboloid, and $H$ is a weight…

For $S \subseteq \{0,1\}^n$ a Boolean function $f \colon S \to \{-1,1\}$ is a polynomial threshold function (PTF) of degree $d$ and weight $W$ if there is a polynomial $p$ with integer coefficients of degree $d$ and with sum of absolute…

We show that there is equality in Shannon's Entropy Power Inequality (EPI) if and only if the random variables involved are Gaussian, assuming nothing beyond the existence of differential entropies. This is done by justifying de Bruijn's…

For a wide class of monotonic functions $f$, we develop a Chernoff-style concentration inequality for quadratic forms $Q_f \sim \sum\limits_{i=1}^n f(\eta_i) (Z_i + \delta_i)^2$, where $Z_i \sim N(0,1)$. The inequality is expressed in terms…

In this work, we use the Shannon informational entropies to study an electron confined in a double quantum dot; we mean the entropy in the space of positions, $S_r$, in the space of momentum, $S_p$, and the total entropy, $S_t = S_r+S_p$.…

This article provides entropic inequalities for binomial-Poisson distributions, derived from the two point space. They appear as local inequalities of the M/M/$\infty$ queue. They describe in particular the exponential dissipation of…

We prove that if conditions I-II (below) hold and there is a sequence of Boolean functions $f_n$ hard to approximate by p-size circuits such that p-size circuit lower bounds for $f_n$ do not have p-size proofs in Extended Frege system EF,…

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…

We give a method to bound the entropy of measures on $SL_{d}(\mathbb{R})/SL_{d}(\mathbb{Z})$ which are invariant under a one parameter diagonal subgroup, in terms of entropy contributions from the regions of the cusp corresponding to…

The weak law of large numbers implies that, under mild assumptions on the source, the Renyi entropy per produced symbol converges (in probability) towards the Shannon entropy rate. This paper quantifies the speed of this convergence for…