Home
Pairs of Compact Convex Sets: Fractional Arithmetic with Convex Sets / Edition 1
Barnes and Noble
Pairs of Compact Convex Sets: Fractional Arithmetic with Convex Sets / Edition 1
Current price: $54.99
Barnes and Noble
Pairs of Compact Convex Sets: Fractional Arithmetic with Convex Sets / Edition 1
Current price: $54.99
Size: OS
Loading Inventory...
*Product information may vary - to confirm product availability, pricing, shipping and return information please contact Barnes and Noble
The book is devoted to the theory of pairs of compact convex sets and in particular to the problem of finding different types of minimal representants of a pair of nonempty compact convex subsets of a locally convex vector space in the sense of the Rådström-Hörmander Theory. Minimal pairs of compact convex sets arise naturally in different fields of mathematics, as for instance in non-smooth analysis, set-valued analysis and in the field of combinatorial convexity.
In the first three chapters of the book the basic facts about convexity, mixed volumes and the Rådström-Hörmander lattice are presented. Then, a comprehensive theory on inclusion-minimal representants of pairs of compact convex sets is given. Special attention is given to the two-dimensional case, where the minimal pairs are uniquely determined up to translations. This fact is not true in higher dimensional spaces and leads to a beautiful theory on the mutual interactions between minimality under constraints, separation and decomposition of convex sets, convexificators and invariants of minimal pairs.
In the first three chapters of the book the basic facts about convexity, mixed volumes and the Rådström-Hörmander lattice are presented. Then, a comprehensive theory on inclusion-minimal representants of pairs of compact convex sets is given. Special attention is given to the two-dimensional case, where the minimal pairs are uniquely determined up to translations. This fact is not true in higher dimensional spaces and leads to a beautiful theory on the mutual interactions between minimality under constraints, separation and decomposition of convex sets, convexificators and invariants of minimal pairs.