Let V be a linear space of even dimension n over a field F of characteristic 0. A subspace W ⊂ ∧ 2 V is maximal singular if rank(w) ≤ n -1 for all w ∈ W and any W W ⊂ ∧ 2 V contains a nonsingular matrix. It is shown that if W ⊂ ∧ 2 V is a maximal singular subspace which is generated by decomposable
Singular spaces of matrices and their application in combinatorics
✍ Scribed by László Lovász
- Book ID
- 112787285
- Publisher
- Springer
- Year
- 1989
- Tongue
- English
- Weight
- 669 KB
- Volume
- 20
- Category
- Article
- ISSN
- 1678-7714
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Bipartitional polynomials are multivariable polynomials Y ,",\*=Ynln(CYOI~CYlorCY,I~..-rCYlnn)r Ck'Ck, defined by a sum over ail partitions of the bpartite number (mn). Recurrence relations, generating functions and some basic properties or these polynomials are given. Applications in Combinatorics
Jacobi approximations in certain Hilbert spaces are investigated. Several weighted inverse inequalities and Poincare inequalities are obtained. Some approximation ŕesults are given. Singular differential equations are approximated by using Jacobi polynomials. This method keeps the spectral accuracy.
This paper discusses the application of block matrices in electric power systems. The storage requirements and the factorization of sparse network type block matrices are discussed. Two recent methods for partial refactorization of sparse matrices are generalized for sparse matrices with variable si