On linear spaces of skew-symmetric matrices of constant rank
โ Scribed by L. Manivel; E. Mezzetti
- Publisher
- Springer
- Year
- 2005
- Tongue
- English
- Weight
- 165 KB
- Volume
- 117
- Category
- Article
- ISSN
- 0025-2611
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
The minimum (symmetric) rank of a simple graph G over a field F is the smallest possible rank among all symmetric matrices over F whose ijth entry (for i / = j) is nonzero whenever {i, j} is an edge in G and is zero otherwise. The problem of determining minimum (symmetric) rank has been studied exte
It is well known that for every finite linear space the number b of lines is greater or equal to the number v of points of the space. In this paper we investigate the relation between the nonnegative integer b -v and suitable configurations of subspaces of a linear space.