Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Contemporary Mathematics Bounds on the Non-convexity of Ranges
 

Summary: Contemporary Mathematics
Bounds on the Non-convexity of Ranges
of Vector Measures with Atoms
Pieter C. Allaart
Abstract. Upper bounds are given for the distance between the range, matrix
range and partition range of a vector measure to the respective convex hulls
of these ranges. The bounds are speci ed in terms of the maximum atom size,
and generalize convexity results of Lyapounov (1940) and Dvoretzky, Wald
and Wolfowitz (1951). Applications are given to the bisection problem, the
"problem of the Nile", and fair division problems.
1. Introduction
Lyapounov's celebrated convexity theorem of 1940 (e.g. 3, 10, 14, 15]) as-
serts that the range of a nite-dimensional, atomless vector measure is convex and
compact. A generalization of Lyapounov's theorem due to Dvoretzky, Wald and
Wolfowitz 6] says that the same is true for the matrix-k-range and the partition
range (see De nition 2.2 below).
If the vector measure has atoms, then convexity of all three ranges may fail
in general, although atomlessness is not a necessary condition. Gouweleeuw 9]
has given necessary and su cient conditions for the range (or matrix-k-range) to
be convex, as well as non-trivial su cient conditions for the partition range to be

  

Source: Allaart, Pieter - Department of Mathematics, University of North Texas

 

Collections: Mathematics