Related papers: Convexity and a sum-product type estimate

The paper considers estimates for some sums and products of functions of prime numbers. Several assertions on this topic have been proven. We also study extremal estimates for strongly additive and strongly multiplicative arithmetic…

We prove that the set of large values of the trigonometric polynomial over a subset of density of the primes has some additive structure, similarly to what happens for subsets of densities in $\mathbb{Z}/{N}\mathbb{Z}$ but in a weaker form.…

We propose a general method for optimization with semi-infinite constraints that involve a linear combination of functions, focusing on the case of the exponential function. Each function is lower and upper bounded on sub-intervals by…

Considering the weighted concept of majorization, Sherman obtained generalization of majorization inequality for convex functions known as Sherman's inequality. We extend Sherman's result to the class of n-strongly convex functions using…

This thesis establishes new quantitative records in several problems of incidence geometry and growth. After the necessary background in Chapters 1, 2 and 3, the following results are proven. Chapter 4 gives new results in the incidence…

Mixed volumes, which are the polarization of volume with respect to the Minkowski addition, are fundamental objects in convexity. In this note we announce the construction of mixed integrals, which are functional analogs of mixed volumes.…

In this paper we provide in $\bFp$ expanding lower bounds for two variables functions $f(x,y)$ in connection with the product set or the sumset. The sum-product problem has been hugely studied in the recent past. A typical result in…

During the study of the topic of limit summability of functions (introduced by the author in 2001), we encountered some types of functions that are related to the mean value theorem. In this paper, we formally define mean value and…

Let $f(z) = \sum A(n) n^{(k-1)/2} e(nz)$ be a cusp form of weight $k \geq 3$ on $\Gamma_0(N)$ with character $\chi$. By studying a certain shifted convolution sum, we prove that $\sum_{n \leq X} A(n^2+h) = c_{f,h} X +…

Ingham studied two types of convolution sums of the divisor function, namely the shifted convolution sum $\sum_{n \le N} d(n) d(n+h)$ and the additive convolution sum $\sum_{n < N} d(n) d(N-n)$ for integers $N, h$ and derived their…

We analyze the role played by $n$-convexity for the fulfillment of a series of linear functional inequalities that extend the Hornich-Hlawka functional inequality, $f\left( x\right) +f\left( y\right) +f\left( z\right) +f\left( x+y+z\right)…

We study the convolution function $$ C[f(x)] := \int_1^x f(y)f({x\over y}) {{\rm d} y\over y} $$ when $f(x)$ is a suitable number-theoretic error term. Asymptotics and upper bounds for $C[f(x)]$ are derived from mean square bounds for…

It is shown that the order and the lower order of growth are equal for all non-trivial solutions of $f^{(k)}+A f=0$ if and only if the coefficient $A$ is analytic in the unit disc and $\log^+ M(r,A)/\log(1-r)$ tends to a finite limit as…

Utilising recent advances in incidence geometry for balls and tubes, and advances in sum-product theory in the discrete setting, we show that for $0 < s \leq 1/2$ and for any $A \subset \mathbb{R}$ with Hausdorff dimension $s$, either the…

Subaddivity type matrix inequalities for concave funcions and symetric norms are given.

We investigate a class of composite nonconvex functions, where the outer function is the sum of univariate extended-real-valued convex functions and the inner function is the limit of difference-of-convex functions. A notable feature of…

Motivated by a long-standing conjecture of Polya and Szeg\"o about the Newtonian capacity of convex bodies, we discuss the role of concavity inequalities in shape optimization, and we provide several counterexamples to the…

The restricted strong convexity is an effective tool for deriving globally linear convergence rates of descent methods in convex minimization. Recently, the global error bound and quadratic growth properties appeared as new competitors. In…

The Shapley-Folkman theorem shows that Minkowski averages of uniformly bounded sets tend to be convex when the number of terms in the sum becomes much larger than the ambient dimension. In optimization, Aubin and Ekeland [1976] show that…

Let $n\ge1$ and $B\ge2$. A real-valued function $f$ defined on the $n$-simplex $\Delta_n$ is approximately convex with respect to $\Delta_{B-1}$ iff f(\sum_{i=1}^B t_ix_i) \le \sum_{i=1}^B t_if(x_i) +1 for all $x_1,...,x_B \in \Delta_n$ and…