English

Extremal Approximately Convex Functions and Estimating the Size of Convex Hulls

Metric Geometry 2007-05-23 v1

Abstract

A real valued function ff defined on a convex KK is anemconvex function iff it satisfies f((x+y)/2)(f(x)+f(y))/2+1. f((x+y)/2) \le (f(x)+f(y))/2 + 1. A thorough study of approximately convex functions is made. The principal results are a sharp universal upper bound for lower semi-continuous approximately convex functions that vanish on the vertices of a simplex and an explicit description of the unique largest bounded approximately convex function~EE vanishing on the vertices of a simplex. A set AA in a normed space is an approximately convex set iff for all a,bAa,b\in A the distance of the midpoint (a+b)/2(a+b)/2 to AA is 1\le 1. The bounds on approximately convex functions are used to show that in Rn\R^n with the Euclidean norm, for any approximately convex set AA, any point zz of the convex hull of AA is at a distance of at most [log2(n1)]+1+(n1)/2[log2(n1)][\log_2(n-1)]+1+(n-1)/2^{[\log_2(n-1)]} from AA. Examples are given to show this is the sharp bound. Bounds for general norms on RnR^n are also given.

Keywords

Cite

@article{arxiv.math/9807107,
  title  = {Extremal Approximately Convex Functions and Estimating the Size of Convex Hulls},
  author = {S. J. Dilworth and Ralph Howard and James W. Roberts},
  journal= {arXiv preprint arXiv:math/9807107},
  year   = {2007}
}

Comments

39 pages. See also http://www.math.sc.edu/~howard/