A combinatorial algorithm for computing the degree of the determinant of a generic partitioned polynomial matrix with \(2\times 2\) submatrices
DOI10.1007/978-3-030-73879-2_9zbMath1483.15003arXiv2104.14841OpenAlexW3163910085MaRDI QIDQ2061866
Publication date: 21 December 2021
Full work available at URL: https://arxiv.org/abs/2104.14841
generic partitioned polynomial matrixweighted Edmonds problemweighted noncommutative Edmonds problem
Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Determinants, permanents, traces, other special matrix functions (15A15) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Numerical computation of determinants (65F40)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An application of simultaneous diophantine approximation in combinatorial optimization
- Constructive non-commutative rank computation is in deterministic polynomial time
- Operator scaling: theory and applications
- Non-commutative Edmonds' problem and matrix semi-invariants
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- Singular spaces of matrices and their application in combinatorics
- A Minimax Theorem and a Dulmage–Mendelsohn Type Decomposition for a Class of Generic Partitioned Matrices
- Computing the nc-Rank via Discrete Convex Optimization on CAT(0) Spaces
- A Combinatorial Algorithm for Computing the Rank of a Generic Partitioned Matrix with 2 $$\times $$ 2 Submatrices
- 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
This page was built for publication: A combinatorial algorithm for computing the degree of the determinant of a generic partitioned polynomial matrix with \(2\times 2\) submatrices
