Singular spaces of matrices and their application in combinatorics
From MaRDI portal
Publication:4005434
DOI10.1007/BF02585470zbMath0757.05035OpenAlexW2015555828MaRDI QIDQ4005434
Publication date: 27 September 1992
Published in: Boletim da Sociedade Brasileira de Matemática (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02585470
Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)
Related Items
A Combinatorial Algorithm for Computing the Rank of a Generic Partitioned Matrix with 2 $$\times $$ 2 Submatrices ⋮ Constructive Non-Commutative Rank Computation Is in Deterministic Polynomial Time. ⋮ A cost-scaling algorithm for computing the degree of determinants ⋮ Simultaneous robust subspace recovery and semi-stability of quiver representations ⋮ Non-commutative Edmonds' problem and matrix semi-invariants ⋮ On rank-critical matrix spaces ⋮ Tripartite-to-bipartite entanglement transformation by stochastic local operations and classical communication and the structure of matrix spaces ⋮ Connections between graphs and matrix spaces ⋮ A combinatorial algorithm for computing the entire sequence of the maximum degree of minors of a generic partitioned polynomial matrix with \(2 \times 2\) submatrices ⋮ Group-theoretic generalisations of vertex and edge connectivities ⋮ Dirichlet fundamental domains and topology of projective varieties. ⋮ On a weighted linear matroid intersection algorithm by deg-det computation ⋮ Algorithms Based on *-Algebras, and Their Applications to Isomorphism of Polynomials with One Secret, Group Isomorphism, and Polynomial Identity Testing ⋮ On the Baer-Lovász-Tutte construction of groups from graphs: isomorphism types and homomorphism notions ⋮ Algebraic Independence and Blackbox Identity Testing ⋮ Computing DM-decomposition of a partitioned matrix with rank-1 blocks ⋮ Finding a low-rank basis in a matrix subspace ⋮ Leader-follower formation via complex Laplacian ⋮ The Betti map associated to a section of an abelian scheme ⋮ Linear matroid intersection is in quasi-NC ⋮ Unnamed Item ⋮ Computing the nc-Rank via Discrete Convex Optimization on CAT(0) Spaces ⋮ Subdeterminant Maximization via Nonconvex Relaxations and Anti-Concentration ⋮ Operator scaling: theory and applications ⋮ A combinatorial algorithm for computing the degree of the determinant of a generic partitioned polynomial matrix with \(2\times 2\) submatrices ⋮ Computing the Degree of Determinants via Discrete Convex Optimization on Euclidean Buildings ⋮ From Independent Sets and Vertex Colorings to Isotropic Spaces and Isotropic Decompositions: Another Bridge between Graphs and Alternating Matrix Spaces ⋮ Spectrum and pseudospectrum for quadratic polynomials in Ginibre matrices ⋮ Sinkhorn-Knopp theorem for PPT states ⋮ Relative invariants of 3 × 3 matrix triples∗ ⋮ A combinatorial algorithm for computing the rank of a generic partitioned matrix with \(2 \times 2\) submatrices ⋮ Computing valuations of the Dieudonné determinants ⋮ Generalized Wong sequences and their applications to Edmonds' problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On some combinatorial properties of algebraic matroids
- The complexity of computing the permanent
- Matching is as easy as matrix inversion
- Constructing a perfect matching is in random NC
- Rubber bands, convex embeddings and graph connectivity
- Matroid matching and some applications
- On graphs and rigidity of plane skeletal structures
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- Complexity of Matroid Property Algorithms
- On Generic Rigidity in the Plane
- Fast Parallel Matrix Inversion Algorithms
- Systems of distinct representatives and linear algebra
- The Factorization of Linear Graphs
