Journal of Convex Analysis, Vol. 4, No. 2, pp. 333-342 (1997)

Decompositions of Compact Convex Sets

Diethard Pallaschke and Ryszard Urbanski

Institut für Statistik und Mathematische Wirtschaftstheorie der Universität Karlsruhe, Kaiserstr. 12, 76128 Karlsruhe, Germany, lh09@rz.uni-karlsruhe.de, and Faculty of Mathematics and Computer Science, Adam Mickiewicz University, Matejki 48/49, 60-769 Poznan, Poland, rich@math.amu.edu.pl

Abstract: In a recent paper R. Urbanski [13] investigated the mimimality of pairs compact convex sets which satisfy additional conditions, namely the minimal convex pairs. In this paper we consider some different possibilities of decomposing a given compact convex set into smaller compact convex sets which are related by translations or by reflections. Combining our results with the characterization of minimality of convex pairs of compact convex sets given in [13] we prove in the second part of this paper that for the two-dimensional case the following statements:
M: equivalent minimal pairs of compact convex sets are uniquely determined up to translations (see [3], [11])
CM: equivalent convex minimal pairs of compact convex sets are uniquely determined up to translations (see [13])
are equivalent.

Keywords: Pairs of convex sets, sublinear function, quasidifferential calculus

Classification (MSC2000): 52A07, 26A27, 90C30

Full text of the article:


[Previous Article] [Next Article] [Contents of this Number]
© 2000 ELibM for the EMIS Electronic Edition