A combinatorial algorithm for computing the entire sequence of the maximum degree of minors of a generic partitioned polynomial matrix with 2 × 2 submatrices
In this paper, we consider the problem of computing the entire sequence of the maximum degree of minors of a block-structured symbolic matrix (a generic partitioned polynomial matrix) A=(Aαβxαβtdαβ) , where Aαβ is a 2 × 2 matrix over a field F , xαβ is an indeterminate, and dαβ is an integer for α=...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Springer Science and Business Media Deutschland GmbH
2023
|
| Subjects: | |
| Online Access: | View Fulltext in Publisher View in Scopus |