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
From MaRDI portal
Publication:6120836
DOI10.1007/s10107-023-01949-1OpenAlexW3210807908MaRDI QIDQ6120836
Publication date: 21 February 2024
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-023-01949-1
degree of minorgeneric partitioned polynomial matrixweighted Edmonds' problemweighted non-commutative Edmonds' problem
Combinatorics in computer science (68R05) Combinatorial optimization (90C27) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Combinatorial relaxation algorithm for the entire sequence of the maximum degree of minors
- An application of simultaneous diophantine approximation in combinatorial optimization
- Computing the maximum degree of minors in matrix pencils via combinatorial relaxation
- Constructive non-commutative rank computation is in deterministic polynomial time
- Commutative/noncommutative rank of linear matrices and subspaces of matrices of low rank
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Classical complexity and quantum entanglement
- Combinatorial relaxation algorithm for the maximum degree of subdeterminants: Computing Smith-McMillan form at infinity and structural indices in Kronecker form
- Computing the maximum degree of minors in mixed polynomial matrices via combinatorial relaxation
- A combinatorial algorithm for computing the degree of the determinant of a generic partitioned polynomial matrix with \(2\times 2\) submatrices
- A combinatorial algorithm for computing the rank of a generic partitioned matrix with \(2 \times 2\) submatrices
- Computing valuations of the Dieudonné determinants
- A cost-scaling algorithm for computing the degree of determinants
- Operator scaling: theory and applications
- Non-commutative Edmonds' problem and matrix semi-invariants
- The likelihood ratio test for a separable covariance matrix
- Combinatorial relaxation algorithm for the entire sequence of the maximum degree of minors in mixed polynomial matrices
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- Rational matrix structure
- Random pseudo-polynomial algorithms for exact matroid problems
- Singular spaces of matrices and their application in combinatorics
- Block-Triangularizations of Partitioned Matrices Under Similarity/Equivalence Transformations
- The mle algorithm for the matrix normal distribution
- A Minimax Theorem and a Dulmage–Mendelsohn Type Decomposition for a Class of Generic Partitioned Matrices
- Primal-Dual Combinatorial Relaxation Algorithms for the Maximum Degree of Subdeterminants
- Computing the nc-Rank via Discrete Convex Optimization on CAT(0) Spaces
- Invariant Theory and Scaling Algorithms for Maximum Likelihood Estimation
- A Weighted Linear Matroid Parity Algorithm
- Computing the Degree of Determinants via Discrete Convex Optimization on Euclidean Buildings
- Systems of distinct representatives and linear algebra
- Les déterminants sur un corps non commutatif
- The Factorization of Linear Graphs
- Derandomizing polynomial identity tests means proving circuit lower bounds
- Matrices and matroids for systems analysis
