The basics of bases (Q2431396)

Assume that the spanning set \(T\) of a \(k\) dimensional vector space \(V\) over a field consists of \(t\) vectors. Let \(f(T)\) be the number of bases of \(V\) in \(T\) (i.e. \(1\leq f(T) \leq \binom{t}{k}).\) The authors find the best possible lower bound of \(f(T)\). They apply this bound to determine the number of triangles in an arbitrary (spanning) set of points in the projective plane. The lower bound is also applied to determine the number of information sets of a projective linear code.