New results on multivariate polynomial matrix factorizations
نویسندگان
چکیده
منابع مشابه
A New Algorithm for General Factorizations of Multivariate Polynomial Matrices
We investigate how to factorize a multivariate polynomial matrix into the product of two matrices. There are two major parts. The first is a factorization theorem, which asserts that a multivariate polynomial matrix whose lower order minors satisfy certain conditions admits a matrix factorization. Our theory is a generalization to the previous results given by Lin et.al [16] and Liu et.al [17]....
متن کاملNotes on n-D Polynomial Matrix Factorizations
This paper discusses a relationship between the prime factorizability of a normal full rank n-D (n > 2) polynomial matrix and its reduced minors. Two conjectures regarding the n-D polynomial matrix prime factorization problem are posed, and a partial solution to one of the conjectures is provided. Another related open problem of factorizing an n-D polynomial matrix that is not of normal full ra...
متن کاملSome New Results On the Hosoya Polynomial of Graph Operations
The Wiener index is a graph invariant that has found extensive application in chemistry. In addition to that a generating function, which was called the Wiener polynomial, who’s derivate is a q-analog of the Wiener index was defined. In an article, Sagan, Yeh and Zhang in [The Wiener Polynomial of a graph, Int. J. Quantun Chem., 60 (1996), 959969] attained what graph operations do to the Wiene...
متن کاملFactorizations and Representations of Binary Polynomial Recurrences by Matrix Methods
In this paper we derive factorizations and representations of a polynomial analogue of an arbitrary binary sequence by matrix methods. It generalizes various results on Fibonacci, Lucas, Chebyshev and MorganVoyce polynomials. 1. Introduction In [10], the divisibility properties of the Fibonacci polynomial sequence ffn (x)g was studied. The Fibonacci polynomial sequence is de ned by the recursi...
متن کاملRiordan group approaches in matrix factorizations
In this paper, we consider an arbitrary binary polynomial sequence {A_n} and then give a lower triangular matrix representation of this sequence. As main result, we obtain a factorization of the innite generalized Pascal matrix in terms of this new matrix, using a Riordan group approach. Further some interesting results and applications are derived.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2013
ISSN: 0024-3795
DOI: 10.1016/j.laa.2012.08.012