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 rank as a product of two n-D polynomial matrices of smaller size is also considered, and a partial solution to this problem is presented. An illustrative example is worked out in details.
منابع مشابه
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.
متن کاملMATRIX FACTORIZATIONS AND INTERTWINERS OF THE FUNDAMENTAL REPRESENTATIONS OF QUANTUM GROUP Uq(sln)
We want to construct a homological link invariant whose Euler characteristic is MOY polynomial as Khovanov and Rozansky constructed a categorification of HOMFLY polynomial. The present paper gives the first step to construct a categorification of MOY polynomial. For the essential colored planar diagrams with additional data which is a sequence naturally induced by coloring, we define matrix fac...
متن کاملMatrix Factorizations, Minimal Models and Massey Products
We present a method to compute the full non–linear deformations of matrix factorizations for ADE minimal models. This method is based on the calculation of higher products in the cohomology, called Massey products. The algorithm yields a polynomial ring whose vanishing relations encode the obstructions of the deformations of the D–branes characterized by these matrix factorizations. This coinci...
متن کاملSparse multivariate factorization by mean of a few bivariate factorizations
We describe an algorithm to factor sparse multivariate polynomials usingO(d) bivariate factorizations where d is the number of variables. This algorithm is implemented in the Giac/Xcas computer algebra system.
متن کاملMatrix Factorizations and Representations of Quivers I
This paper introduces a mathematical definition of the category of D-branes in Landau-Ginzburg orbifolds in terms of A∞-categories. Our categories coincide with the categories of (gradable) matrix factorizations for quasi-homogeneous polynomials. After setting up the necessary definitions, we prove that our category for the polynomial x is equivalent to the derived category of representations o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999