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 (Q6120836): Difference between revisions

Latest revision as of 11:24, 27 August 2024

scientific article; zbMATH DE number 7807805

Language	Label	Description	Also known as
English	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	scientific article; zbMATH DE number 7807805

Statements

instance of

scholarly article

0 references

title

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 (English)

0 references

author

Yuni Iwamasa

0 references

published in

Mathematical Programming. Series A. Series B

0 references

publication date

21 February 2024

0 references

zbMATH Keywords

generic partitioned polynomial matrix

0 references

degree of minor

0 references

weighted Edmonds' problem

0 references

weighted non-commutative Edmonds' problem

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/s10107-023-01949-1

0 references

cites work

Invariant Theory and Scaling Algorithms for Maximum Likelihood Estimation

0 references

Random pseudo-polynomial algorithms for exact matroid problems

0 references

Q4848757

0 references

Les déterminants sur un corps non commutatif

0 references

The mle algorithm for the matrix normal distribution

0 references

Systems of distinct representatives and linear algebra

0 references

Commutative/noncommutative rank of linear matrices and subspaces of matrices of low rank

0 references

An application of simultaneous diophantine approximation in combinatorial optimization

0 references

Operator scaling: theory and applications

0 references

Classical complexity and quantum entanglement

0 references

Computing the nc-Rank via Discrete Convex Optimization on CAT(0) Spaces

0 references

Computing the Degree of Determinants via Discrete Convex Optimization on Euclidean Buildings

0 references

A cost-scaling algorithm for computing the degree of determinants

0 references

A combinatorial algorithm for computing the rank of a generic partitioned matrix with \(2 \times 2\) submatrices

0 references

Block-Triangularizations of Partitioned Matrices Under Similarity/Equivalence Transformations

0 references

Non-commutative Edmonds' problem and matrix semi-invariants

0 references

Constructive non-commutative rank computation is in deterministic polynomial time

0 references

A combinatorial algorithm for computing the degree of the determinant of a generic partitioned polynomial matrix with \(2\times 2\) submatrices

0 references

Computing the maximum degree of minors in matrix pencils via combinatorial relaxation

0 references

A Weighted Linear Matroid Parity Algorithm

0 references

A Minimax Theorem and a Dulmage–Mendelsohn Type Decomposition for a Class of Generic Partitioned Matrices

0 references

Primal-Dual Combinatorial Relaxation Algorithms for the Maximum Degree of Subdeterminants

0 references

Computing the maximum degree of minors in mixed polynomial matrices via combinatorial relaxation

0 references

Derandomizing polynomial identity tests means proving circuit lower bounds

0 references

Q5708359

0 references

Q3891767

0 references

Singular spaces of matrices and their application in combinatorics

0 references

The likelihood ratio test for a separable covariance matrix

0 references

Combinatorial relaxation algorithm for the maximum degree of subdeterminants: Computing Smith-McMillan form at infinity and structural indices in Kronecker form

0 references

Matrices and matroids for systems analysis

0 references

Computing valuations of the Dieudonné determinants

0 references

Combinatorial relaxation algorithm for the entire sequence of the maximum degree of minors in mixed polynomial matrices

0 references

Combinatorial relaxation algorithm for the entire sequence of the maximum degree of minors

0 references

Combinatorial optimization. Polyhedra and efficiency (3 volumes)

0 references

Fast Probabilistic Algorithms for Verification of Polynomial Identities

0 references

The Factorization of Linear Graphs

0 references

Rational matrix structure

0 references

Identifiers

DOI

10.1007/s10107-023-01949-1

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:6120836

@@ Property / cites work @@
+Invariant Theory and Scaling Algorithms for Maximum Likelihood Estimation
+Normal rank
@@ Property / cites work @@
+Random pseudo-polynomial algorithms for exact matroid problems
+Normal rank
@@ Property / cites work @@
+Q4848757
@@ Property / cites work: Q4848757 / rank @@
+Normal rank
@@ Property / cites work @@
+Les déterminants sur un corps non commutatif
@@ Property / cites work: Les déterminants sur un corps non commutatif / rank @@
+Normal rank
@@ Property / cites work @@
+The mle algorithm for the matrix normal distribution
+Normal rank
@@ Property / cites work @@
+Systems of distinct representatives and linear algebra
+Normal rank
@@ Property / cites work @@
+Commutative/noncommutative rank of linear matrices and subspaces of matrices of low rank
+Normal rank
@@ Property / cites work @@
+An application of simultaneous diophantine approximation in combinatorial optimization
+Normal rank
@@ Property / cites work @@
+Operator scaling: theory and applications
@@ Property / cites work: Operator scaling: theory and applications / rank @@
+Normal rank
@@ Property / cites work @@
+Classical complexity and quantum entanglement
@@ Property / cites work: Classical complexity and quantum entanglement / rank @@
+Normal rank
@@ Property / cites work @@
+Computing the nc-Rank via Discrete Convex Optimization on CAT(0) Spaces
+Normal rank
@@ Property / cites work @@
+Computing the Degree of Determinants via Discrete Convex Optimization on Euclidean Buildings
+Normal rank
@@ Property / cites work @@
+A cost-scaling algorithm for computing the degree of determinants
+Normal rank
@@ Property / cites work @@
+A combinatorial algorithm for computing the rank of a generic partitioned matrix with \(2 \times 2\) submatrices
+Normal rank
@@ Property / cites work @@
+Block-Triangularizations of Partitioned Matrices Under Similarity/Equivalence Transformations
+Normal rank
@@ Property / cites work @@
+Non-commutative Edmonds' problem and matrix semi-invariants
+Normal rank
@@ Property / cites work @@
+Constructive non-commutative rank computation is in deterministic polynomial time
+Normal rank
@@ Property / cites work @@
+A combinatorial algorithm for computing the degree of the determinant of a generic partitioned polynomial matrix with \(2\times 2\) submatrices
+Normal rank
@@ Property / cites work @@
+Computing the maximum degree of minors in matrix pencils via combinatorial relaxation
+Normal rank
@@ Property / cites work @@
+A Weighted Linear Matroid Parity Algorithm
@@ Property / cites work: A Weighted Linear Matroid Parity Algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+A Minimax Theorem and a Dulmage–Mendelsohn Type Decomposition for a Class of Generic Partitioned Matrices
+Normal rank
@@ Property / cites work @@
+Primal-Dual Combinatorial Relaxation Algorithms for the Maximum Degree of Subdeterminants
+Normal rank
@@ Property / cites work @@
+Computing the maximum degree of minors in mixed polynomial matrices via combinatorial relaxation
+Normal rank
@@ Property / cites work @@
+Derandomizing polynomial identity tests means proving circuit lower bounds
+Normal rank
@@ Property / cites work @@
+Q5708359
@@ Property / cites work: Q5708359 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3891767
@@ Property / cites work: Q3891767 / rank @@
+Normal rank
@@ Property / cites work @@
+Singular spaces of matrices and their application in combinatorics
+Normal rank
@@ Property / cites work @@
+The likelihood ratio test for a separable covariance matrix
+Normal rank
@@ Property / cites work @@
+Combinatorial relaxation algorithm for the maximum degree of subdeterminants: Computing Smith-McMillan form at infinity and structural indices in Kronecker form
+Normal rank
@@ Property / cites work @@
+Matrices and matroids for systems analysis
@@ Property / cites work: Matrices and matroids for systems analysis / rank @@
+Normal rank
@@ Property / cites work @@
+Computing valuations of the Dieudonné determinants
+Normal rank
@@ Property / cites work @@
+Combinatorial relaxation algorithm for the entire sequence of the maximum degree of minors in mixed polynomial matrices
+Normal rank
@@ Property / cites work @@
+Combinatorial relaxation algorithm for the entire sequence of the maximum degree of minors
+Normal rank
@@ Property / cites work @@
+Combinatorial optimization. Polyhedra and efficiency (3 volumes)
+Normal rank
@@ Property / cites work @@
+Fast Probabilistic Algorithms for Verification of Polynomial Identities
+Normal rank
@@ Property / cites work @@
+The Factorization of Linear Graphs
@@ Property / cites work: The Factorization of Linear Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Rational matrix structure
@@ Property / cites work: Rational matrix structure / rank @@
+Normal rank