Related papers: Pl\"unnecke's Inequality
The aim of this paper is to prove a general version of Pl\"unnecke's inequality. Namely, assume that for finite sets $A$, $B_1, ... B_k$ we have information on the size of the sumsets $A+B_{i_1}+... +B_{i_l}$ for all choices of indices…
We generalize Petridis's new proof of Pl\"unnecke's graph inequality to graphs whose vertex set is a measure space. Consequently, this gives new Pl\"unnecke inequalities for measure preserving actions which enable us to deduce, via a…
We present a new method to bound the cardinality of triple product sets in groups and give three applications. A new and unexpectedly short proof of the Plunnecke-Ruzsa sumset inequalities for Abelian groups. A new proof of a theorem of Tao…
The Pl\"unnecke-Ruzsa inequality is a fundamental tool to control the growth of finite subsets of abelian groups under repeated addition and subtraction. Other tools to handle sumsets have gained applicability by being extended to more…
Recently, Grynkiewicz et al. [{\it Israel J. Math.} {\bf 193} (2013), 359--398], using tools from additive combinatorics and group theory, proved necessary and sufficient conditions under which the linear congruence $a_1x_1+\cdots…
We extend some sharp inequalities for martingale-differences to general multiplicative systems of random variables. The key ingredient in the proofs is a technique reducing the general case to the case of Rademacher random variables without…
A new notion of partition-determined functions is introduced, and several basic inequalities are developed for the entropy of such functions of independent random variables, as well as for cardinalities of compound sets obtained using these…
This preprint is a text for students and teachers on inequalities. Some standard topics are covered on application of calculus to inequality proving. Many examples are considered, stated, solved or partially solved. Some problems are…
A proof of the continuous martingale convergence theorem is provided. It relies on a classical martingale inequality and the almost sure convergence of a uniformly bounded non-negative super-martingale, after a truncation argument.
Sumset estimates, which provide bounds on the cardinality of sumsets of finite sets in a group, form an essential part of the toolkit of additive combinatorics. In recent years, probabilistic or entropic analogs of many of these…
In this article we present a Bernstein inequality for sums of random variables which are defined on a graphical network whose nodes grow at an exponential rate. The inequality can be used to derive concentration inequalities in…
The $p$-set, which is in a simple analytic form, is well distributed in unit cubes. The well-known Weil's exponential sum theorem presents an upper bound of the exponential sum over the $p$-set. Based on the result, one shows that the…
A Neumaier graph is a non-complete edge-regular graph containing a regular clique. A Neumaier graph that is not strongly regular is called a strictly Neumaier graph. In this work we present a new construction of strictly Neumaier graphs,…
We investigate the lower asymptotic density of sumsets in $\mathbb{N}^2$ by proving certain Pl\"unnecke type inequalities for various notions of lower density in $\mathbb{N}^2$. More specifically, we introduce a notion of lower tableaux…
The magnitude of a graph is one of a family of cardinality-like invariants extending across mathematics; it is a cousin to Euler characteristic and geometric measure. Among its cardinality-like properties are multiplicativity with respect…
Composite optimization problems, where the sum of a smooth and a merely lower semicontinuous function has to be minimized, are often tackled numerically by means of proximal gradient methods as soon as the lower semicontinuous part of the…
We prove a noncommutative analogue of Minkowski's integral inequality for commuting squares of tracial von Neumann algebras. The inequality implies a necessary condition for a quadruple of graphs to be realized as inclusion graphs of a…
We present an elementary, self-contained proof of Grothendieck's inequality that unifies the real and complex cases and yields both the Krivine and Haagerup bounds, the current best-known explicit bounds for the real and complex…
The estimate in Bullen's inequality will be extended for continuous functions using the second order modulus of smoothness. A different form of this inequality will be given in terms of the least concave majorant. Also, the composite case…
The present note is an essential addition to the author's arxiv paper arXiv:2001.01070, concerning general multiplicative systems of random variables. Using some lemmas and the methodology of \cite{Kar4}, we obtain a general extreme…