Minimal sets of vectors which generate $R_n$ with excess $k$
Miroslav Fiedler · Czechoslovak Mathematical Journal · 1979
It is the purpose of this note to give a simple proof of the fact that, for fixed integers n ^ 1 and /c ^ 0, the smallest set of vectors in an n-dimensional real vector space R" which generates R" as its convex hull and preserves this property even after re moving any к of the vectors, has cardinahty n + 2k + 1.An equivalent result is proved in [l].1. Preliminaries.In the whole paper, Я" will denote an n-dimensional real vector space.The cardinality of a set S will be denoted by card S.