Related papers: Convex Holder bound and its applications
We find a nontrivial upper bound on the average value of the function M(n) which associates to every positive integer n the minimal Hamming weight of a multiple of n. Some new results about the equation M(n)=M(n') are given.
The softmax function is a ubiquitous component at the output of neural networks and increasingly in intermediate layers as well. This paper provides convex lower bounds and concave upper bounds on the softmax function, which are compatible…
We prove a sharp bound between sampling numbers and entropy numbers in the uniform norm for bounded convex sets of bounded functions.
Sharp upper and lower bounds for the second and third order Hermitian-Toepilitz determinants are obtained for some generalized subclasses of starlike and convex functions. Applications of these results are also discussed for several widely…
We prove bounds for the covering numbers of classes of convex functions and convex sets in Euclidean space. Previous results require the underlying convex functions or sets to be uniformly bounded. We relax this assumption and replace it…
Given an operator convex function $f(x)$, we obtain an operator-valued lower bound for $cf(x) + (1-c)f(y) - f(cx + (1-c)y)$, $c \in [0,1]$. The lower bound is expressed in terms of the matrix Bregman divergence. A similar inequality is…
Let $\pi$ be a cuspidal automorphic representation of a general linear group over the rational numbers. We establish a subconvex bound for the standard $L$-function of $\pi$ in the $t$-aspect. More generally, we address the spectral aspect…
We use sup-convolution to find upper approximations of a bounded $m$-subharmonic function on a compact K\"ahler manifold with nonnegative holomorphic bisectional curvature. As an application, we show the H\"older continuity of solutions to…
More precise estimates for the Bergman metric on strongly pseudoconvex domains are given, based on the use of the squeezing function.
A new proof of Oka's lemma is given for smoothly bounded, pseudoconvex domains $D\subset\mathbb{C}^n$. The method of proof is then also applied to other convexity-like hypotheses on the boundary of $D$.
Recently, Agievich proposed an interesting upper bound on binomial coefficients in the de Moivre-Laplace form. In this article, we show that the latter bound, in the specific case of a central binomial coefficient, is larger than the one…
We give the proof of a tight lower bound on the probability that a binomial random variable exceeds its expected value. The inequality plays an important role in a variety of contexts, including the analysis of relative deviation bounds in…
We give exponential upper bounds for $P(S \le k)$, in particular $P(S=0)$, where $S$ is a sum of indicator random variables that are positively associated. These bounds allow, in particular, a comparison with the independent case. We give…
We determine those norms on B(H) whose unit ball is C*-convex. We call them M-norms and show that the class of M-norms less than a given norm enjoys a maximum element. These minimum and maximum elements will be determined in some cases.…
In this paper, a new lemma is proved and inequalities of Simpson type are established for co-ordinated convex functions and bounded functions.
We use Salem's method to prove that there is a lower bound for partial sums of series of bi-orthogonal vectors in a Hilbert space, or the dual vectors. This is applied to some lower bounds on $L^{1}$ norms for orthogonal expansions. There…
The functional equations of the Riemann zeta function, the Hurwitz zeta function, and the Lerch zeta function have been well known for a long time, and there is great importance in studying these zeta functions. For example, fundamental…
We present an extensive analysis of relative deviation bounds, including detailed proofs of two-sided inequalities and their implications. We also give detailed proofs of two-sided generalization bounds that hold in the general case of…
We consider the problem of lower bounding a generalized Minkowski measure of subsets of a convex body with a log-concave probability measure, conditioned on the set size. A bound is given in terms of diameter and set size, which is sharp…
It is well-known that every convex function admits an affine support at every interior point of a domain. Convex functions of higher order (precisely of an odd order) have a similar property: they are supported by the polynomials of degree…