Related papers: A Multiplication Technique for the Factorization o…
Nonunique factorization in commutative monoids is often studied using factorization invariants, which assign to each monoid element a quantity determined by the factorization structure. For numerical monoids (co-finite, additive submonoids…
We prove that the Buchweitz-Greuel-Schreyer Conjecture on the minimal rank of a matrix factorization holds for a generic polynomial of given degree and strength. The proof introduces a notion of the secondary strength of a polynomial, and…
For any polynomial $P \in \mathbb{C}[X_1,X_2,...,X_n]$, we describe a $\mathbb{C}$-vector space $F(P)$ of solutions of a linear system of equations coming from some algebraic partial differential equations such that the dimension of $F(P)$…
Linear differential equations of arbitrary order with polynomial coefficients are considered. Specifically, necessary and sufficient conditions for the existence of polynomial solutions of a given degree are obtained for these equations. An…
A very simple and short proof of the polynomial matrix spectral factorization theorem (on the unit circle as well as on the real line) is presented, which relies on elementary complex analysis and linear algebra.
We consider bivariate polynomials orthogonal on the bicircle with respect to a positive linear functional. The lexicographical and reverse lexicographical orderings are used to order the monomials. Recurrence formulas are derived between…
We present algorithmic, complexity and implementation results concerning real root isolation of integer univariate polynomials using the continued fraction expansion of real algebraic numbers. One motivation is to explain the method's good…
This paper derives numerical bounds for and implements the splitting circle method for finding roots of a univariate polynomial in the presence of fixed precision.
We apply general difference calculus in order to obtain solutions to the functional equations of the second order. We show that factorization method can be successfully applied to the functional case. This method is equivariant under the…
We pose the question of what is the best generalization of the factorial and the binomial coefficient. We give several examples, derive their combinatorial properties, and demonstrate their interrelationships. On cherche ici \`a…
This paper establishes new upper bounds for the right eigenvalues of monic matrix polynomials over the quaternion division algebra. The noncommutative nature of quaternion multiplication presents fundamental challenges in eigenvalue…
We describe a simple approach to factorize non-commutative (nc) polynomials, that is, elements in free associative algebras (over a commutative field), into atoms (irreducible elements) based on (a special form of) their minimal linear…
Consider a polynomial optimization problem. Adding polynomial equations generated by the Fritz John conditions to the constraint set does not change the optimal value. As proved in [arXiv:2205.04254 (2022)], the objective polynomial has…
This article proposes a bivariate polynomial problem for finite-order real matrices that endows a \textit{`sufficient condition'} for a map from the standard vector spaces of finite-order real matrices to the same dimensional bivariate…
We present a few factorizations of polynomials over finite fields. These factorizations are related to traces, compositions of polynomials and binomial coefficients. As a corollary we obtain a description of all irreducible polynomials…
In recent years many efforts have been devoted to finding bidiagonal factorizations of nonsingular totally positive matrices, since their accurate computation allows to numerically solve several important algebraic problems with great…
We present a new algorithm for isolating the real roots of a system of multivariate polynomials, given in the monomial basis. It is inspired by existing subdivision methods in the Bernstein basis; it can be seen as generalization of the…
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,…
The relationship between a polynomial's zeros and factors is well known. If a is a zero of f(x) then (x-a) is a factor of f(x). In this paper, we generalize this idea to polynomials of two variables and with real coefficients. We consider…
Quaternion optimization has attracted significant interest due to its broad applications, including color face recognition, video compression, and signal processing. Despite the growing literature on quadratic and matrix quaternion…