Maximal generalized rank in graphical matrix spaces
From MaRDI portal
Abstract: In this note we prove two extensions of a recent combinatorial characterization due to Li, Qiao, Wigderson, Wigderson and Zhang (arXiv:2206.04815) of the maximal dimension of bounded rank subspaces of the graphical matrix space associated with a bipartite graph. Our first result shows that the above characterization remains valid for a wide class of generalized rank functions, including e.g. the permanental rank. Our second result extends the characterization to bounded rank subspaces of the graphical alternating matrix space associated with a general graph.
Recommendations
- Maximal rank in matrix spaces via graph matchings
- Maximal graphs with respect to rank
- ON THE MAXIMAL RANK IN A SUBSPACE OF MATRICES
- The maximum order of adjacency matrices of graphs with a given rank
- On rank of a matrix associated with graph
- A GENERALISATION OF HIGHER-RANK GRAPHS
- On the maximum rank of totally nonnegative matrices
- A generalization of the notion of the rank function of a matroid
- Maximum norms of graphs and matrices, and their complements
- Maximal rank and minimal generation
Cites work
- Combinatorial Nullstellensatz
- Connections between graphs and matrix spaces
- scientific article; zbMATH DE number 854567 (Why is no real title available?)
- scientific article; zbMATH DE number 5174567 (Why is no real title available?)
- Maximal rank in matrix spaces via graph matchings
- On Spaces of Linear Transformations with Bounded Rank
- On the linear preservers of Schur matrix functionals
- ON THE MAXIMAL RANK IN A SUBSPACE OF MATRICES
- Permanent Polya problem for additive surjective maps
- Spaces of \(p\)-vectors of bounded rank
Cited in
(3)
This page was built for publication: Maximal generalized rank in graphical matrix spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6076194)