scientific article; zbMATH DE number 1130739

From MaRDI portal
Publication:4382552





For pairs of compact convex subsets of a real topological vector space, the following equivalence relation \(\sim\) and partial ordering \(\leq\) are considered: \((A, B)\sim(C, D)\) if and only if \(A+ D= B+ C\), with \(+\) denoting the Minkowski addition; \((A, B)\leq (C, D)\) if and only if \(A\subseteq C\) and \(B\subseteq D\). A pair \((A, B)\) is said to be convex if \(A\cup B\) is convex; if one further has \(A\subseteq B\) or \(B\subseteq A\) then \((A, B)\) is said to be monotone. Minimality of a pair is meant in the sense of the partial ordering \(\leq\); in the same way, convex (respectively, monotone) minimality means minimality with respect to \(\leq\) in the set of convex (resp., monotone) pairs. The main result in the paper states that, in the two-dimensional case, replacing ``minimal by ``convex minimal or by ``monotone minimal in the statement ``equivalent minimal pairs of compact convex sets are uniquely determined up to translations gives rise to an equivalent statement. Another result in the paper states that (in arbitrary dimension) the sum \(A+B\) of two compact convex sets is a polytope (if and) only if \(A\) and \(B\) are polytopes, too.




Cited in
(26)








This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4382552)