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
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/s10107-023-01949-1 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S10107-023-01949-1 / rank | |||
Normal rank | |||
Latest revision as of 18:37, 30 December 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
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
21 February 2024
0 references
generic partitioned polynomial matrix
0 references
degree of minor
0 references
weighted Edmonds' problem
0 references
weighted non-commutative Edmonds' problem
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
