Singular spaces of matrices and their application in combinatorics

No abstract is available for this paper.

• Publication year

  1989

• Venue

  Boletim da Sociedade Brasileira de Matemática - Bulletin/Brazilian Mathematical Society

• Publication date

  1989-10-01

• Fields of study

  Mathematics

• Identifiers
  DOI 10.1007/BF02585470
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Rubber bands, convex embeddings and graph connectivity

  1988cited by this paper
• On some combinatorial properties of algebraic matroids

  1987cited by this paper
• Matching is as easy as matrix inversion

  1987cited by this paper
• Constructing a perfect matching is in random NC

  1985cited by this paper
• Complexity of Matroid Property Algorithms

  1982cited by this paper
• On Generic Rigidity in the Plane

  1982cited by this paper
• Fast Probabilistic Algorithms for Verification of Polynomial Identities

  1980cited by this paper
• Matroid matching and some applications

  1980cited by this paper
• The Complexity of Computing the Permanent

  1979cited by this paper
• On determinants, matchings, and random algorithms

  1979cited by this paper
• Matroids as the Study of Geometrical Configurations

  1977cited by this paper
• Fast parallel matrix inversion algorithms

  1975cited by this paper
• On graphs and rigidity of plane skeletal structures

  1970cited by this paper
• Systems of distinct representatives and linear algebra

  1967cited by this paper
• The Factorization of Linear Graphs

  1947cited by this paper
• The Geometry of Determinantal Loci

  1939cited by this paper
• Über Graphen und ihre Anwendung auf Determinantentheorie und Mengenlehre

  1916cited by this paper

• Singular vector spaces for computing the structured distance to singularity

  2026cites this paper
• A scaling characterization of nc-rank via unbounded gradient flow

  2025cites this paper
• On average orders of automorphism groups of bilinear maps over finite fields

  2025cites this paper
• Graph Conditions and Distributed Control for 3-D Similar Formation with Shared z-Axis Alignment

  2025cites this paper
• Trading Determinism for Noncommutativity in Edmonds' Problem

  2024cites this paper
• Structural Preprocessing Method for Nonlinear Differential-Algebraic Equations Using Linear Symbolic Matrices

  2024cites this paper
• Hitting Sets for Orbits of Circuit Classes and Polynomial Families

  2024cites this paper
• Characterizing and Testing Principal Minor Equivalence of Matrices

  2024cites this paper
• Algorithmic aspects of semistability of quiver representations

  2024cites this paper
• On the Linear Algebraic Monoids Associated to Congruence of Matrices

  2023cites this paper
• Algebraic combinatorial optimization on the degree of determinants of noncommutative symbolic matrices

  2023influential citation
• Border Complexity of Symbolic Determinant under Rank One Restriction

  2023cites this paper
• The Noncommutative Edmonds' Problem Re-visited

  2023cites this paper
• Rook Theory of the Etzion-Silberstein Conjecture

  2022cites this paper
• Algebraic Algorithms for Fractional Linear Matroid Parity via Non-commutative Rank

  2022cites this paper
• Provably Stable Learning Control of Linear Dynamics With Multiplicative Noise

  2022cites this paper
• Rédacteurs en chef / Chief Editors

  2022cites this paper
• Connections between graphs and matrix spaces

  2022cites this paper
• Detecting positive quantum capacities of quantum channels

  2021cites this paper
• A combinatorial algorithm for computing the entire sequence of the maximum degree of minors of a generic partitioned polynomial matrix with 2×2\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs}

  2021cites this paper
• Symbolic determinant identity testing and non-commutative ranks of matrix Lie algebras

  2021cites this paper
• Coherent information of a quantum channel or its complement is generically positive

  2021cites this paper
• A combinatorial algorithm for computing the degree of the determinant of a generic partitioned polynomial matrix with 2×2 submatrices

  2021cites this paper
• Integer Programming and Combinatorial Optimization: 21st International Conference, IPCO 2020, London, UK, June 8–10, 2020, Proceedings

  2020cites this paper
• Simultaneous robust subspace recovery and semi-stability of quiver representations

  2020cites this paper
• Computing the nc-Rank via Discrete Convex Optimization on CAT(0) Spaces

  2020cites this paper
• A WAY TO GENERATE SINGULAR MATRIX

  2020cites this paper
• A cost-scaling algorithm for computing the degree of determinants

  2020cites this paper
• Spectrum and pseudospectrum for quadratic polynomials in Ginibre matrices

  2020cites this paper
• On Solving (Non)commutative Weighted Edmonds' Problem

  2020cites this paper
• Sample Complexity of Data-Driven Stochastic LQR with Multiplicative Uncertainty

  2020cites this paper
• A combinatorial algorithm for computing the rank of a generic partitioned matrix with 2×2\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt}

  2020cites this paper
• On the Baer-Lovász-Tutte construction of groups from graphs: Isomorphism types and homomorphism notions

  2020cites this paper
• Computing the Maximum Degree of Minors in Skew Polynomial Matrices

  2019cites this paper
• From independent sets and vertex colorings to isotropic spaces and isotropic decompositions

  2019cites this paper
• Group-theoretic generalisations of vertex and edge connectivities

  2019cites this paper
• On a weighted linear matroid intersection algorithm by Deg-Det computation

  2019cites this paper
• Abstract 3-Rigidity and Bivariate $C_2^1$-Splines II: Combinatorial Characterization.

  2019influential citation
• ON THE BETTI MAP ASSOCIATED TO ABELIAN LOGARITHMS

  2019cites this paper
• Graphs and Geometry

  2019cites this paper
• Sinkhorn–Knopp theorem for PPT states

  2019cites this paper
• Recent progress on scaling algorithms and applications

  2018cites this paper
• Computing the Degree of Determinants via Discrete Convex Optimization on Euclidean Buildings

  2018influential citation
• Applications of matrix spaces in quantum information and computational complexity

  2018cites this paper
• Sinkhorn–Knopp theorem for PPT states

  2018cites this paper
• The Betti map associated to a section of an abelian scheme

  2018cites this paper
• New Algorithmic Paradigms for Discrete Problems using Dynamical Systems and Polynomials

  2018cites this paper
• Structured & learnable regularizers for modeling inverse problems in fast MRI

  2018influential citation
• Computing degree of determinant via discrete convex optimization on Euclidean building

  2018influential citation
• Maximum vanishing subspace problem, CAT(0)-space relaxation, and block-triangularization of partitioned matrix

  2017cites this paper
• Subspace Aware Recovery of Low Rank and Jointly Sparse Signals

  2017cites this paper
• Linear Matroid Intersection is in Quasi-NC

  2017cites this paper
• On rank-critical matrix spaces

  2017cites this paper
• Subdeterminant Maximization via Nonconvex Relaxations and Anti-Concentration

  2017cites this paper
• Algorithms based on *-algebras, and their applications to isomorphism of polynomials with one secret, group isomorphism, and polynomial identity testing

  2017cites this paper
• Tripartite-to-Bipartite Entanglement Transformation by Stochastic Local Operations and Classical Communication and the Structure of Matrix Spaces

  2016cites this paper
• Computing DM-decomposition of a partitioned matrix with rank-1 blocks

  2016cites this paper
• Greedy Strikes Again: A Deterministic PTAS for Commutative Rank of Matrix Spaces

  2016cites this paper
• Non-commutative Edmonds’ problem and matrix semi-invariants

  2015influential citation
• Operator Scaling: Theory and Applications

  2015cites this paper
• A Deterministic Polynomial Time Algorithm for Non-commutative Rational Identity Testing

  2015cites this paper
• Recovery of Low Rank and Jointly Sparse Matrices with Two Sampling Matrices

  2015cites this paper
• Finding a low-rank basis in a matrix subspace

  2015cites this paper
• Constructive non-commutative rank computation is in deterministic polynomial time

  2015cites this paper
• Geometric representations of graphs

  2014cites this paper
• Subspace based low rank & joint sparse matrix recovery

  2014cites this paper
• Generalized Wong sequences and their applications to Edmonds' problems

  2013cites this paper
• Independence in Algebraic Complexity Theory

  2013cites this paper
• Realizability of similar formation and local control of directed multi-agent networks in discrete-time

  2013cites this paper
• Fast Deterministic Algorithms for Matrix Completion Problems

  2013influential citation
• Leader-follower formation via complex Laplacian

  2013cites this paper
• Dirichlet fundamental domains and topology of projective varieties

  2013cites this paper
• AND COMPLEX–PROJECTIVE

  2012cites this paper
• Dirichlet fundamental domains and topology of projective varieties

  2012cites this paper
• Complex Laplacian and pattern formation in multi-agent systems

  2012cites this paper
• Algebraic independence and blackbox identity testing

  2011cites this paper
• Computational complexity in entanglement transformations

  2010cites this paper
• Multipartite-to-bipartite entanglement transformations and polynomial identity testing

  2009cites this paper
• Deterministic Polynomial Time Algorithms for Matrix Completion Problems

  2009influential citation
• Detecting Rational Points on Hypersurfaces over Finite Fields

  2008cites this paper
• Classical and quantum algorithms for algebraic problems

  2007cites this paper
• Eigenvalues of graphs

  2007cites this paper
• The complexity of matrix completion

  2006cites this paper
• Small Maximal Spaces of Non‐Invertible Matrices

  2004influential citation
• Semidefinite Programs and Combinatorial Optimization

  2003cites this paper
• Relative invariants of 3 × 3 matrix triples

  2000cites this paper
• Background Material

  year unknowncites this paper