Related papers: Pl\"unnecke's Inequality
Bernstein's classical inequality asserts that given a trigonometric polynomial $T$ of degree $n\geq1$, the sup-norm of the derivative of $T$ does not exceed $n$ times the sup-norm of $T$. We present various approaches to prove this…
The Koml\'os$\unicode{x2013}$Major$\unicode{x2013}$Tusn\'ady (KMT) inequality for partial sums is one of the most celebrated results in probability theory. Yet its practical application has been hindered by a lack of practical constants.…
We prove that the previously established inequality of different metrics for algebraic polynomials is sharp in the sense of order.
The classical Grothendieck inequality is viewed as a statement about representations of functions of two variables over discrete domains by integrals of two-fold products of functions of one variable. An analogous statement is proved,…
We propose a general condition, to ensure essential self-adjointness for the Gau{\ss}-Bonnet operator, based on a notion of completeness as Chernoff. This gives essential self-adjointness of the Laplace operator both for functions or…
The work of this paper is devoted to obtaining strong laws for intermediately trimmed sums of random variables with infinite means. Particularly, we provide conditions under which the intermediately trimmed sums of independent but not…
Graph aggregation is the process of computing a single output graph that constitutes a good compromise between several input graphs, each provided by a different source. One needs to perform graph aggregation in a wide variety of…
In this paper we shall prove a sharpened version of the Finsler-Hadwiger inequality which is a strong generalization of Weitzenbock inequality. After that we give another refinement of this inequality and in the final part we provide some…
Many statistical estimation procedures lead to nonconvex optimization problems. Algorithms to solve these are often guaranteed to output a stationary point of the optimization problem. Oracle inequalities are an important theoretical…
A novel approach is proposed to establish a sharp upper bound on the expected supremum of a separable martingale random field, serving as an alternative to classical universal chaining-based methods. The proposed approach begins by deriving…
This thesis develops a new divergence that generalizes relative entropy and can be used to compare probability measures without a requirement of absolute continuity. We establish properties of the divergence, and in particular derive and…
In this paper, we study the conjecture of Gardner and Zvavitch from \cite{GZ}, which suggests that the standard Gaussian measure $\gamma$ enjoys $\frac{1}{n}$-concavity with respect to the Minkowski addition of \textbf{symmetric} convex…
Improving and extending recent results of the author, we conditionally estimate exponential sums with Dirichlet coefficients of L-functions, both over all integers and over all primes in an interval. In particular, we establish new…
Given an integer $k$, deciding whether a graph has a clique of size $k$ is an NP-complete problem. Wilf's inequality provides a spectral bound for the clique number of simple graphs. Wilf's inequality is stated as follows: $\frac{n}{n -…
The subgradient projection iteration is a classical method for solving a convex inequality. Motivated by works of Polyak and of Crombez, we present and analyze a more general method for finding a fixed point of a cutter, provided that the…
We obtain sharp estimate on $p$-spectral gaps, or equivalently optimal constant in $p$-Poincar\'e inequalities, for metric measure spaces satisfying measure contraction property. We also prove the rigidity for the sharp $p$-spectral gap.
In this paper, we establish an extension of a noncommutative Bennett inequality with a parameter $1\leq r\leq2$ and use it together with some noncommutative techniques to establish a Rosenthal inequality. We also present a noncommutative…
Point counting estimates are a key stepping stone to various results in metric Diophantine approximation. In this paper we use the quantitative non-divergence estimates originally developed by Kleinbock and Margulis to improve lower bounds…
The matching polynomial of a graph is the generating function of the numbers of its matchings with respect to their cardinality. A graph polynomial is polynomial reconstructible, if its value for a graph can be determined from its values…
We obtain an asymptotically sharp error bound in the classical Sudakov-Fernique comparison inequality for finite collections of gaussian random variables. Our proof is short and self-contained, and gives an easy alternative argument for the…