Related papers: An Elementary Proof of the Polynomial Matrix Spect…
We define the non-stationary analogue of the Wiener algebra and prove a spectral factorization theorem in this algebra.
One of the most famous results in Complex Analysis is the Little Picard Theorem, that characterizes the image set of an arbitrary entire function. Specifically, the theorem states that this image set is either the whole complex plane or the…
We study algebraic properties of full rank 1 algebras in a general framework and derive a method to verify if one such matrix polynomial sub-algebra is bispectral. We give two examples illustrating the method. In the first one, we consider…
For a given Laurent polynomial matrix function $S$, which is positive definite on the unit circle in the complex plane, we consider all possible polynomial spectral factors of $S$ which are not necessarily invertible inside the unit circle.
In this paper we give a factorization theorem for the ring of exponential polynomials in many variables over an algebraically closed field of characteristic 0 with an exponentiation. This is a generalization of the factorization theorem due…
Already for bivariate tropical polynomials, factorization is an NP-Complete problem. In this paper, we give an efficient algorithm for factorization and rational factorization of a rich class of tropical polynomials in $n$ variables.…
This is a short review of some recent results obtained by the author. These results are related the problem of obtaining polynomial identities (computational formulas) for some matrix functions by means of the known polarization theorem,…
This paper considers some work done by the author and Catlin [CD1,CD2,CD3] concerning positivity conditions for bihomogeneous polynomials and metrics on bundles over certain complex manifolds. It presents a simpler proof of a special case…
By nonstandard analysis, a very short and elementary proof of the Spectral Theorem for unbounded self-adjoint operators is given.
We give a remarkably elementary proof of the Brouwer fixed point theorem. The proof is verifiable for most of the mathematicians.
We prove that the hyperbolicity cones of elementary symmetric polynomials are spectrahedral, i.e., they are slices of the cone of positive semidefinite matrices. The proof uses the matrix--tree theorem, an idea already present in Choe et…
We provide sufficient conditions for systems of polynomial equations over general (real or complex) algebras to have a solution. This generalizes known results on quaternions, octonions and matrix algebras. We also generalize the…
We give an efficient algorithm which can obtain a relative error approximation to the spectral norm of a matrix, combining the power iteration method with some techniques from matrix reconstruction which use random sampling.
In this paper, we prove several generalizations and applications of a fixed point theorem. This theorem is used to prove the existence and uniqueness of solutions of the linear sparse matrix problem considered.
This note deals with a simultaneous approximation of several matrices by a finite family of diagonalizable matrices satisfying an additional condition for the spectrum of a matrix product. That is the simplicity of all eigenvalues.
We consider some combinatorial problems on matrix polynomials over finite fields. Using results from control theory we give a proof of a result of Helmke, Jordan and Lieb on the number of linear unimodular matrix polynomials over a finite…
We provide elementary proof of several congruences involving single sum and multisums of binomial coefficients.
We present an elementary combinatorial proof of the celebrated Friendship theorem. The proof involves looking at independent sets and constructing a bound on their size which forces a contradiction.
Spectral factorization is a prominent tool with several important applications in various areas of applied science. Wiener and Masani proved the existence of matrix spectral factorization. Their theorem has been extended to the…
A new necessary and sufficient condition for the existence of minor left prime factorizations of multivariate polynomial matrices without full row rank is presented. The key idea is to establish a relationship between a matrix and its full…