Research Communication | Open Access
Volume 2021 | Communication ID 252
Volume 2021 | Communication ID 252
| Solving the principal minors assignment problem |
Rachid Matoui, Karim Driss
Received |
Accepted |
Published |
January 31, 2021 |
February 15, 2021 |
March 15, 2021 |
Abstract: Also known as the PMAP, the Principal Minors Assignment Problem consists of determining if a vector A of length 2n can stand as the vector of the principal minors of some nxn matrix A. Griffin and Tsatsomeros [1] and later Gonzalez and Carmona [2] gave an algorithmic solution to this problem. Under a genericity condition, their works [1] produce in a polynomial-time a matrix A or determines that none exist, the solution is however not unique. The question regarding and equivalence relation between matrices having equal principal minors of all orders discussed by Hartfiel, D.J., Loewy R. ...