Invariant Form of BK-factorization and its Applications

Invariant form of BK-factorization is presented, it is used for factorization of the LPDOs equivalent under gauge transformation and for construction of approximate factorization simplifying numerical simulsations with corresponding LPDEs of higher orderComment: 11 pages, 7 figure

Constructive factorization of LPDO in two variables

We study conditions under which a partial differential operator of arbitrary order $n$ in two variables or ordinary linear differential operator admits a factorization with a first-order factor on the left. The factorization process consists of solving, recursively, systems of linear equations, subject to certain differential compatibility conditions. In the generic case of partial differential operators one does not have to solve a differential equation. In special degenerate cases, such as ordinary differential, the problem is finally reduced to the solution of some Riccati equation(s). The conditions of factorization are given explicitly for second- and, and an outline is given for the higher-order case.Comment: 16 pages, to be published in Journal "Theor. Math. Phys." (2005

Factorization of Z-homogeneous polynomials in the First (q)-Weyl Algebra

We present algorithms to factorize weighted homogeneous elements in the first polynomial Weyl algebra and $q$-Weyl algebra, which are both viewed as a $\mathbb{Z}$-graded rings. We show, that factorization of homogeneous polynomials can be almost completely reduced to commutative univariate factorization over the same base field with some additional uncomplicated combinatorial steps. This allows to deduce the complexity of our algorithms in detail. Furthermore, we will show for homogeneous polynomials that irreducibility in the polynomial first Weyl algebra also implies irreducibility in the rational one, which is of interest for practical reasons. We report on our implementation in the computer algebra system \textsc{Singular}. It outperforms for homogeneous polynomials currently available implementations dealing with factorization in the first Weyl algebra both in speed and elegancy of the results.Comment: 26 pages, Singular implementation, 2 algorithms, 1 figure, 2 table

Analogue of Newton-Puiseux series for non-holonomic D-modules and factoring

We introduce a concept of a fractional-derivatives series and prove that any linear partial differential equation in two independent variables has a fractional-derivatives series solution with coefficients from a differentially closed field of zero characteristic. The obtained results are extended from a single equation to $D$-modules having infinite-dimensional space of solutions (i. e. non-holonomic $D$-modules). As applications we design algorithms for treating first-order factors of a linear partial differential operator, in particular for finding all (right or left) first-order factors

Multiple Factorizations of Bivariate Linear Partial Differential Operators

We study the case when a bivariate Linear Partial Differential Operator (LPDO) of orders three or four has several different factorizations. We prove that a third-order bivariate LPDO has a first-order left and right factors such that their symbols are co-prime if and only if the operator has a factorization into three factors, the left one of which is exactly the initial left factor and the right one is exactly the initial right factor. We show that the condition that the symbols of the initial left and right factors are co-prime is essential, and that the analogous statement "as it is" is not true for LPDOs of order four. Then we consider completely reducible LPDOs, which are defined as an intersection of principal ideals. Such operators may also be required to have several different factorizations. Considering all possible cases, we ruled out some of them from the consideration due to the first result of the paper. The explicit formulae for the sufficient conditions for the complete reducibility of an LPDO were found also