Related papers: Factorization of a Matrix Differential Operator Us…
A classification of commutative integral domains consisting of ordinary differential operators with matrix coefficients is established in terms of morphisms between algebraic curves.
In this note we prove that the factorization theorem for dominated polynomials previously proved by the authors is equivalent to an alternative factorization scheme that uses classical linear techniques and a linearization process. However,…
Using the modified factorization method employed by Mielnik for the harmonic oscillator, we show that isospectral structures associated with a second order operator $H$, can always be constructed whenever $H$ could be factored, or exist…
Parametric models in vector spaces are shown to possess an associated linear map. This linear operator leads directly to reproducing kernel Hilbert spaces and affine- / linear- representations in terms of tensor products. From the…
We prove that any linear operator with kernel in a Pilipovi\'c or Gelfand-Shilov space can be factorized by two operators in the same class. We also give links on numerical approximations for such compositions. We apply these composition…
Given a non-zero polynomial $f$ in a polynomial ring $R$ with coefficients in a finite field of prime characteristic $p$, we present an algorithm to compute a differential operator $\delta$ which raises $1/f$ to its $p$th power. For some…
Recently Dritschel proves that any positive multivariate Laurent polynomial can be factorized into a sum of square magnitudes of polynomials. We first give another proof of the Dritschel theorem. Our proof is based on the univariate matrix…
Many matrices associated with fast transforms posess a certain low-rank property characterized by the existence of several block partitionings of the matrix, where each block is of low rank. Provided that these partitionings are known,…
Factorization of quantum mechanical potentials has a long history extending back to the earliest days of the subject. In the present paper, the non-uniqueness of the factorization is exploited to derive new isospectral non-singular…
Matrix factorization is a key tool in data analysis; its applications include recommender systems, correlation analysis, signal processing, among others. Binary matrices are a particular case which has received significant attention for…
We study monic univariate polynomials whose coefficients are analytic functions of a real variable and whose roots lie in a specified analytic curve. These include characteristic polynomials of unitary and hermitian matrices whose entries…
Polynomial factorization in conventional sense is an ill-posed problem due to its discontinuity with respect to coefficient perturbations, making it a challenge for numerical computation using empirical data. As a regularization, this paper…
We characterize those sequences of weighted isobaric polynomials as defined in math.CO/0106213 which belong to the kernel of the linear operator $D_{11} - \sum_{j=1}^k a_j t_j D_{2j} - mD_2$, and we characterize those linear operators of…
In this paper we investigate factorizations of polynomials over the ring of dual quaternions into linear factors. While earlier results assume that the norm polynomial is real ("motion polynomials"), we only require the absence of real…
A sharp bound is obtained for the number of ways to express the monomial $X^n$ as a product of linear factors over $\mathbb{Z}/p^{\alpha}\mathbb{Z}$. The proof relies on an induction-on-scale procedure which is used to estimate the number…
There is a commutative algebra of differential-difference operators, with two parameters, associated to any dihedral group with an even number of reflections. The intertwining operator relates this algebra to the algebra of partial…
Given a function on diagonal matrices, there is a unique way to extend this to an invariant (by conjugation) function on symmetric matrices. We show that the extension preserves regularity -- that is, if the original function is k times…
This paper studies the unitary diagonalization of matrices over formal power series rings. Our main result shows that a normal matrix is unitarily diagonalizable if and only if its minimal polynomial completely splits over the ring and the…
Interpolation and approximation of functionals with conditionally positive definite kernels is considered on sets of centers that are not determining for polynomials. It is shown that polynomial consistency is sufficient in order to define…
Polynomial factorization and root finding are among the most standard themes of computational mathematics. Yet still, little has been done for polynomials over quaternion algebras, with the single exception of Hamiltonian quaternions for…