Minor Prime Factorization for -D Polynomial Matrices over Arbitrary Coefficient Field

Jinwang Liu, Dongmei Li and Licui Zheng

Complexity, 2018, vol. 2018, 1-9

Abstract:

In this paper, we investigate two classes of multivariate ( -D) polynomial matrices whose coefficient field is arbitrary and the greatest common divisor of maximal order minors satisfy certain condition. Two tractable criterions are presented for the existence of minor prime factorization, which can be realized by programming and complexity computations. On the theory and application, we shall obtain some new and interesting results, giving some constructive computational methods for carrying out the minor prime factorization.

Date: 2018
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/8503/2018/6235649.pdf (application/pdf)
http://downloads.hindawi.com/journals/8503/2018/6235649.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:complx:6235649

DOI: 10.1155/2018/6235649

Access Statistics for this article

More articles in Complexity from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().