Rank-width and well-quasi-ordering of skew-symmetric or symmetric matrices
DOI10.1016/j.laa.2011.09.027zbMath1244.15027arXiv1007.3807OpenAlexW2107623929WikidataQ112882186 ScholiaQ112882186MaRDI QIDQ2427899
Publication date: 19 April 2012
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1007.3807
Schur complementfinite fieldmatroidrank-widthwell-quasi-orderrank decompositionLagrangian chain group
Matrices over special rings (quaternions, finite fields, etc.) (15B33) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Hermitian, skew-Hermitian, and related matrices (15B57) Combinatorial aspects of matroids and geometric lattices (05B35) Vector spaces, linear dependence, rank, lineability (15A03)
Related Items
Cites Work
- Graph minors. XX: Wagner's conjecture
- A Menger-like property of tree-width: The finite case
- Isotropic systems
- A simple theorem on 3-connectivity
- Representability of \(\bigtriangleup\)-matroids over \(GF(2)\)
- Graph minors. X: Obstructions to tree-decomposition
- Branch-width and well-quasi-ordering in matroids and graphs.
- Principal pivot transforms: Properties and applications
- Approximating clique-width and branch-width
- Graph minors. IV: Tree-width and well-quasi-ordering
- A Class Of Abelian Groups
- Rank-Width and Well-Quasi-Ordering
- Greedy algorithm and symmetric matroids
- Lectures on matroids
- Menger's theorem for matroids
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item