The minimal number of circuits in a finite set in \(R^{2k-1}\) (Q1063236)

A circuit in \({\mathfrak R}^ d\) is an affinely dependent subset \(C\subset {\mathfrak R}^ d\) such that every proper subset of C is affinely independent. It is proved in this paper that if S is a subset of \({\mathfrak R}\) of cardinality n and d is odd, then S contains at least \(r\left( \begin{matrix} q\\ 3\end{matrix} \right)+(k-r)\left( \begin{matrix} q+1\\ 3\end{matrix} \right)\) circuits, where \(d=2k-1\), \(n=qk+r\), and \(0\leq r<k\).