English
Related papers

Related papers: Upper Minkowski dimension estimates for convex res…

200 papers

For $\alpha\ge 0$, let $\mathcal{W}(\alpha)$ be the class of all analytic functions in the unit disk $\mathbb{D}$ with normalization $f(0) = 0 $ and $ f'(0) = 1 $ that satisfy the relation $Re\,\{f'(z) + \alpha z f''(z)\} > 0$. This article…

Complex Variables · Mathematics 2026-05-20 Chayani Dhara , Nirupam Ghosh

Given a real-valued function $c$ defined on the cartesian product of a generic Carnot group $\G$ and the first layer $V_1$ of its Lie algebra, we introduce a notion of $c$ horizontal convex ($c$ H-convex) function on $\G$ as the supremum of…

Differential Geometry · Mathematics 2010-05-07 Andrea Calogero , Rita Pini

We investigate the convexity property on $(0,1)$ of the function $$f_a(x)=\frac{{\cal K}{(\sqrt x)}}{a-(1/2)\log(1-x)}.$$ We show that $f_a$ is strictly convex on $(0,1)$ if and only if $a\geq a_c$ and $1/f_a$ is strictly convex on $(0,1)$…

General Mathematics · Mathematics 2024-07-30 Mohamed Bouali

Given a subset $A\times B$ of a locally convex space $X\times Y$ (with $A$ compact) and a function $f:A\times B\rightarrow\overline{\mathbb{R}}$ such that $f(\cdot,y),$ $y\in B,$ are concave and upper semicontinuous, the minimax inequality…

Optimization and Control · Mathematics 2023-08-21 M. I. A. Ghitri , A. Hantoute

In the article the authors consider the class ${\mathcal H}_0$ of sense-preserving harmonic functions $f=h+\overline{g}$ defined in the unit disk $|z|<1$ and normalized so that $h(0)=0=h'(0)-1$ and $g(0)=0=g'(0)$, where $h$ and $g$ are…

Complex Variables · Mathematics 2015-06-02 Liulan Li , Saminathan Ponnusamy

Let $\mathcal S$ denote the class of all functions of the form $f(z)=z+a_2z^2+a_3z^3+\cdots$ which are analytic and univalent in the open unit disk $\ID$ and, for $\lambda >0$, let $\Phi_\lambda (n,f)=\lambda a_n^2-a_{2n-1}$ denote the…

Complex Variables · Mathematics 2016-03-24 Liulan Li , Saminathan Ponnusamy , Jinjing Qiao

It has been well established that first order optimization methods can converge to the maximal objective value of concave functions and provide constant factor approximation guarantees for (non-convex/non-concave) continuous submodular…

Optimization and Control · Mathematics 2021-06-10 Siddharth Mitra , Moran Feldman , Amin Karbasi

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…

Optimization and Control · Mathematics 2019-07-02 Thomas Kerdreux , Igor Colin , Alexandre d'Aspremont

Suppose $0 < \alpha \leq n$, $H: \Bbb R^n \to [0,1]$ is a Lebesgue measurable function, and $A_\alpha(H)$ is the infimum of all numbers $C$ for which the inequality $\int_B H(x) dx \leq C R^\alpha$ holds for all balls $B \subset \Bbb R^n$…

Classical Analysis and ODEs · Mathematics 2022-06-14 Bassam Shayya

The $\Gamma $-limit of a family of functionals $u\mapsto \int_{\Omega }f\left( \frac{x}{\varepsilon },\frac{x}{\varepsilon ^{2}},D^{s}u\right) dx$ is obtained for $s=1,2$ and when the integrand $f=f\left( y,z,v\right) $ is a continous…

Optimization and Control · Mathematics 2019-11-07 Joel Fotso Tachago , Giuliano Gargiulo , Hubert Nnang , Elvira Zappale

Let $K\subset \mathbb{C}$ be a polynomially convex compact set, $f$ be a function analytic in a domain $\overline{\mathbb{C}}\smallsetminus K$ with Taylor expansion $f\left( z\right) =\sum_{k=0}^{\infty }\frac{a_{k}}{z^{k+1}} $ at $\infty…

Complex Variables · Mathematics 2024-01-19 Ozan Günyüz , Vyacheslav Zakharyuta

Let ${\mathcal B}(H)$ denote the Banach algebra of all bounded linear operators on a complex Hilbert space $H$ with $\dim H\geq 3$, and let $\mathcal A$ and $\mathcal B$ be subsets of ${\mathcal B}(H)$ which contain all rank one operators.…

Functional Analysis · Mathematics 2017-05-01 Jianlian Cui , Chi-Kwong Li , Nung-Sing Sze

We prove that if $f:\mathbb{R}^n\to\mathbb{R}$ is convex and $A\subset\mathbb{R}^n$ has finite measure, then for any $\varepsilon>0$ there is a convex function $g:\mathbb{R}^n\to\mathbb{R}$ of class $C^{1,1}$ such that $\mathcal{L}^n(\{x\in…

Classical Analysis and ODEs · Mathematics 2020-11-23 Daniel Azagra , Piotr Hajłasz

We consider mesh functions which are discrete convex in the sense that their central second order directional derivatives are positive. Analogous to the case of a uniformly bounded sequence of convex functions, we prove that the uniform…

Numerical Analysis · Mathematics 2019-11-01 Gerard Awanou

The elliptic integral and its various generalizations are playing very important and basic role in different branches of modern mathematics. It is well known that they cannot be represented by the elementary transcendental functions.…

Classical Analysis and ODEs · Mathematics 2017-05-17 Zhen-Hang Yang , Jingfeng Tian

The most important open problem in Monotone Operator Theory concerns the maximal monotonicity of the sum of two maximally monotone operators provided that Rockafellar's constraint qualification holds. In this paper, we prove the maximal…

Functional Analysis · Mathematics 2010-10-22 Liangjin Yao

In this article, we present some new inequalities for numerical radius of Hilbert space operators via convex functions. Our results generalize and improve earlier results by El-Haddad and Kittaneh. Among several results, we show that if…

Functional Analysis · Mathematics 2019-07-16 S. Tafazoli , H. R. Moradi , S. Furuichi , P. Harikrishnan

Given a function $f$ defined on a nonempty and convex subset of the $d$-dimensional Euclidean space, we prove that if $f$ is bounded from below and it satisfies a convexity-type functional inequality with infinite convex combinations, then…

Classical Analysis and ODEs · Mathematics 2025-09-16 Matyas Barczy , Zsolt Páles

Here is one of the results of this paper (with the convention ${{1}\over {0}}=+\infty$): Let $X$ be a real Hilbert space and let $J:X\to {\bf R}$ be a $C^1$ functional, with compact derivative, such that $$\alpha^*:=\max\left…

Functional Analysis · Mathematics 2015-10-20 Biagio Ricceri

We establish new upper and lower bounds on the number of queries required to test convexity of functions over various discrete domains. 1. We provide a simplified version of the non-adaptive convexity tester on the line. We re-prove the…

Computational Complexity · Computer Science 2019-08-08 Aleksandrs Belovs , Eric Blais , Abhinav Bommireddi