ﻻ يوجد ملخص باللغة العربية
A univariate trace polynomial is a polynomial in a variable x and formal trace symbols Tr(x^j). Such an expression can be naturally evaluated on matrices, where the trace symbols are evaluated as normalized traces. This paper addresses global and constrained positivity of univariate trace polynomials on symmetric matrices of all finite sizes. A tracial analog of Artins solution to Hilberts 17th problem is given: a positive semidefinite univariate trace polynomial is a quotient of sums of products of squares and traces of squares of trace polynomials.
The usual univariate interpolation problem of finding a monic polynomial f of degree n that interpolates n given values is well understood. This paper studies a variant where f is required to be composite, say, a composition of two polynomials of deg
Univariate fractions can be transformed to mixed fractions in the equational theory of meadows of characteristic zero.
We estimate the density of tubes around the algebraic variety of decomposable univariate polynomials over the real and the complex numbers.
In this paper, we first present simple proofs of Chois results [4], then we give a short alternative proof for Fiedler and Markhams inequality [6]. We also obtain additional matrix inequalities related to partial determinants.
We consider the set of monic real univariate polynomials of a given degree $d$ with non-vanishing coefficients, with given signs of the coefficients and with given quantities of their positive and negative roots (all roots are distinct). For $d=6$ an