On averaging multisets

DOI10.1007/BF01299637MaRDI QIDQ1909220zbMATH OpenFDO

Authors Alexander Durner

Publication date 11 March 1996

Published in Monatshefte für Mathematik (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/178711

zbMATH Keywords

averaging setsconvex sets

Mathematics Subject Classification ID

Affine analytic geometry (51N10) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20)

Review text

The path rank of \(M \subseteq \mathbb{R}^s\), denoted \(\text{prk }M\), is defined as the maximum number of (continuous) paths \(\varphi : [0,1] \to M\) whose principal chords \(\varphi(1) - \varphi(0)\) are independent. The author proves that if \(\text{prk } M = s\) then each point in the interior of the convex hull of \(M\) can be written as a convex combination with rational coefficients of \(2s\) points in \(M\). This bound is sharp, as shown by an example. However, for \(s > 1\), if for each \(m \in M\) there exists a nonconstant path \(\varphi : [0,1] \to M\) such that \(\varphi(0) = m\), the bound \(2s\) can be lowered to \(2s-1\). This bound is sharp as well.

Recommendations

• Rank of convex combinations of matrices
• scientific article; zbMATH DE number 1234828
• Do Minkowski averages get progressively more convex?
• On two-path convexity in multipartite tournaments
• Averaging sets: A generalization of mean values and spherical designs

Cites work

• Averaging sets: A generalization of mean values and spherical designs
• Interior points of the convex hull of few points in \(\mathbb{E}^ d\)
• On a new method for constructing good point sets on spheres
• On averaging sets

Cited in

(2)

• Averaging sets: A generalization of mean values and spherical designs
• Some Examples of Combinatorial Averaging

This page was built for publication: On averaging multisets

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