The basics of bases (Q2431396)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5877667
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The basics of bases |
scientific article; zbMATH DE number 5877667 |
Statements
The basics of bases (English)
0 references
13 April 2011
0 references
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.
0 references
basis of a vector space
0 references
spanninng set
0 references
simplex
0 references
MDS code
0 references
projective space
0 references
projective line
0 references
linear code
0 references
generator matrix
0 references
0 references
0.7531116604804993
0 references
0.7357130646705627
0 references
0.7309905290603638
0 references
0.7274188995361328
0 references
