English
Related papers

Related papers: On an entropic analogue of additive energy

200 papers

Following a growing number of studies that, over the past 15 years, have established entropy inequalities via ideas and tools from additive combinatorics, in this work we obtain a number of new bounds for the differential entropy of sums,…

Information Theory · Computer Science 2025-11-20 Rupert Li , Lampros Gavalakis , Ioannis Kontoyiannis

Various lower bounds are established for the entropy of sums, products and their combinations. First, we derive a prime-field analogue of a version of the entropy power inequality established by Tao over torsion-free groups. Next, we prove…

Combinatorics · Mathematics 2026-04-30 Lampros Gavalakis , Marcel K. Goh , Ioannis Kontoyiannis

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…

Quantum Physics · Physics 2014-02-21 Robert Koenig , Graeme Smith

In the paper we prove that any sumset or difference set has large E_3 energy. Also, we give a full description of families of sets having critical relations between some kind of energies such as E_k, T_k and Gowers norms. In particular, we…

Combinatorics · Mathematics 2014-05-14 Ilya D. Shkredov

The entropy power inequality (EPI) provides lower bounds on the differential entropy of the sum of two independent real-valued random variables in terms of the individual entropies. Versions of the EPI for discrete random variables have…

Information Theory · Computer Science 2013-01-18 Saeid Haghighatshoar , Emmanuel Abbe , Emre Telatar

This is an analysis of the additivity of the entropy of thermodynamical systems with finite heat baths. It is presented an expression for the physical entropy of weakly interacting ergodic systems, and it is shown that it is valid for both…

Statistical Mechanics · Physics 2007-05-23 M. P. Almeida

Let $\mathsf{N}_{\rm d}\left[X\right]=\frac{1}{2\pi {\rm e}}{\rm e}^{2\mathsf{H}\left[X\right]}$ denote the entropy power of the discrete random variable $X$ where $\mathsf{H}\left[X\right]$ denotes the discrete entropy of $X$. In this…

Information Theory · Computer Science 2019-05-09 Ehsan Nekouei , Mikael Skoglund , Karl Henrik Johansson

We prove a lower estimate on the increase in entropy when two copies of a conditional random variable $X | Y$, with $X$ supported on $\mathbb{Z}_q=\{0,1,\dots,q-1\}$ for prime $q$, are summed modulo $q$. Specifically, given two i.i.d copies…

Information Theory · Computer Science 2014-11-27 Venkatesan Guruswami , Ameya Velingker

We prove new exponents for the energy version of the Erd\H{o}s-Szemer\'edi sum-product conjecture, raised by Balog and Wooley. They match the previously established milestone values for the standard formulation of the question, both for…

Combinatorics · Mathematics 2017-06-06 Misha Rudnev , Ilya D. Shkredov , Sophie Stevens

The entropic doubling $\sigma_{\operatorname{ent}}[X]$ of a random variable $X$ taking values in an abelian group $G$ is a variant of the notion of the doubling constant $\sigma[A]$ of a finite subset $A$ of $G$, but it enjoys somewhat…

Number Theory · Mathematics 2024-09-05 Ben Green , Freddie Manners , Terence Tao

An extension of the entropy power inequality to the form $N_r^\alpha(X+Y) \geq N_r^\alpha(X) + N_r^\alpha(Y)$ with arbitrary independent summands $X$ and $Y$ in $\mathbb{R}^n$ is obtained for the R\'enyi entropy and powers $\alpha \geq…

Information Theory · Computer Science 2017-10-25 Sergey Bobkov , Arnaud Marsiglietti

Let $G = (G,+)$ be an additive group. The sumset theory of Pl\"unnecke and Ruzsa gives several relations between the size of sumsets $A+B$ of finite sets $A, B$, and related objects such as iterated sumsets $kA$ and difference sets $A-B$,…

Combinatorics · Mathematics 2020-04-08 Terence Tao

Given a subset of real numbers $A$ with small product $AA$ we obtain a new upper bound for the additive energy of $A$. The proof uses a natural observation that level sets of convolutions of the characteristic function of $A$ have small…

Combinatorics · Mathematics 2019-11-28 Konstantin I. Olmezov , Aliaksei S. Semchankau , Ilya D. Shkredov

It is known that the additivity conjecture of Holevo capacity, output minimum entoropy, and the entanglement of formation (EoF), are equivalent with each other. Among them, the output minimum entropy is simplest, and hence many researchers…

Quantum Physics · Physics 2009-11-11 Keiji Matsumoto

We show that $h_\infty(X+Y)\leq h_\infty(Z+W)$, where $X, Y$ are independent log-concave random variables, and $Z, W$ are exponential random variables having the same respective $\infty$-R\'enyi entropies. Analogs for integer-valued…

Probability · Mathematics 2025-11-03 Zhen Fu , Jiange Li

Generalized entropies are studied as Lyapunov functions for the Master equation (Markov chains). Three basic properties of these Lyapunov functions are taken into consideration: universality (independence of the kinetic coefficients),…

Statistical Mechanics · Physics 2007-05-23 Pavel Gorban

Following the sum-product paradigm, we prove that for a set $B$ with polynomial growth, the product set $B.B$ cannot contain large subsets with size of order $|B|^2$ with small doubling. It follows that the additive energy of $B.B$ is…

Number Theory · Mathematics 2015-02-13 Dmitry Zhelezov

The entropic form $S_q$ is, for any $q \neq 1$, {\it nonadditive}. Indeed, for two probabilistically independent subsystems, it satisfies $S_q(A+B)/k=[S_q(A)/k]+[S_q(B)/k]+(1-q)[S_q(A)/k][S_q(B)/k] \ne S_q(A)/k+S_q(B)/k$. This form will…

Data Analysis, Statistics and Probability · Physics 2014-11-18 Constantino Tsallis

The aim of the paper is to study the link between non additivity of some entropies and their boundedness. We propose an axiomatic construction of the entropy relying on the fact that entropy belongs to a group isomorphic to the usual…

Statistical Mechanics · Physics 2009-11-11 Pierre-Olivier Amblard , Christophe Vignat

The sumset and inverse sumset theories of Freiman, Pl\"{u}nnecke and Ruzsa, give bounds connecting the cardinality of the sumset $A+B=\{a+b\;;\;a\in A,\,b\in B\}$ of two discrete sets $A,B$, to the cardinalities (or the finer structure) of…

Information Theory · Computer Science 2015-05-07 Ioannis Kontoyiannis , Mokshay Madiman
‹ Prev 1 2 3 10 Next ›