A general theory of almost convex functions
Abstract
Let be the standard -dimensional simplex of non-negative tuples that sum to unity and let be a nonempty subset of . A real valued function defined on a convex subset of a real vector space is -almost convex iff for all and the inequality h(t_0 x_0+ ... +t_m x_m)\leq 1+ t_0 h(x_0)+ ... +t_m h(x_m) holds. A detailed study of the properties of -almost convex functions is made, including the constriction of the extremal (i.e. pointwise largest bounded) -almost convex function on simplices that vanishes on the vertices. In the special case that is the barycenter of very explicit formulas are given for the extremal function and its maximum. This is of interest as the extremal function and its maximum give the best constants in various geometric and analytic inequalities and theorems.
Cite
@article{arxiv.math/0101262,
title = {A general theory of almost convex functions},
author = {S. J. Dilworth and Ralph Howard and James W. Roberts},
journal= {arXiv preprint arXiv:math/0101262},
year = {2007}
}
Comments
40 pages with 5 postscript figures. Minor errors and typographical errors corrected