The basics of bases (Q2431396): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s00283-010-9149-4 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1968230241 / rank | |||
Normal rank | |||
Revision as of 23:12, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The basics of bases |
scientific article |
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
