Minor Prime Factorization for n-D Polynomial Matrices over Arbitrary Coefficient Field
In this paper, we investigate two classes of multivariate (n-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...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2018-01-01
|
| Series: | Complexity |
| Online Access: | http://dx.doi.org/10.1155/2018/6235649 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832564726828105728 |
|---|---|
| author | Jinwang Liu Dongmei Li Licui Zheng |
| author_facet | Jinwang Liu Dongmei Li Licui Zheng |
| author_sort | Jinwang Liu |
| collection | DOAJ |
| description | In this paper, we investigate two classes of multivariate (n-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. |
| format | Article |
| id | doaj-art-0d5398ff61eb41ed90e6d79fb4c51e90 |
| institution | Kabale University |
| issn | 1076-2787 1099-0526 |
| language | English |
| publishDate | 2018-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Complexity |
| spelling | doaj-art-0d5398ff61eb41ed90e6d79fb4c51e902025-02-03T01:10:19ZengWileyComplexity1076-27871099-05262018-01-01201810.1155/2018/62356496235649Minor Prime Factorization for n-D Polynomial Matrices over Arbitrary Coefficient FieldJinwang Liu0Dongmei Li1Licui Zheng2School of Mathematics and Computing Sciences, Hunan University of Science and Technology, Xiangtan, Hunan, 411201, ChinaSchool of Mathematics and Computing Sciences, Hunan University of Science and Technology, Xiangtan, Hunan, 411201, ChinaSchool of Mathematics and Computing Sciences, Hunan University of Science and Technology, Xiangtan, Hunan, 411201, ChinaIn this paper, we investigate two classes of multivariate (n-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.http://dx.doi.org/10.1155/2018/6235649 |
| spellingShingle | Jinwang Liu Dongmei Li Licui Zheng Minor Prime Factorization for n-D Polynomial Matrices over Arbitrary Coefficient Field Complexity |
| title | Minor Prime Factorization for n-D Polynomial Matrices over Arbitrary Coefficient Field |
| title_full | Minor Prime Factorization for n-D Polynomial Matrices over Arbitrary Coefficient Field |
| title_fullStr | Minor Prime Factorization for n-D Polynomial Matrices over Arbitrary Coefficient Field |
| title_full_unstemmed | Minor Prime Factorization for n-D Polynomial Matrices over Arbitrary Coefficient Field |
| title_short | Minor Prime Factorization for n-D Polynomial Matrices over Arbitrary Coefficient Field |
| title_sort | minor prime factorization for n d polynomial matrices over arbitrary coefficient field |
| url | http://dx.doi.org/10.1155/2018/6235649 |
| work_keys_str_mv | AT jinwangliu minorprimefactorizationforndpolynomialmatricesoverarbitrarycoefficientfield AT dongmeili minorprimefactorizationforndpolynomialmatricesoverarbitrarycoefficientfield AT licuizheng minorprimefactorizationforndpolynomialmatricesoverarbitrarycoefficientfield |