Related papers: Positive univariate trace polynomials
A noncommutative polynomial is stable if it is nonsingular on all tuples of matrices whose imaginary parts are positive definite. In this paper a characterization of stable polynomials is given in terms of strongly stable linear matrix…
We introduce G{\aa}rding polynomials, a class of real multivariate polynomials characterized by positivity regions that are invariant under translation by positive vectors and closed under strictly positive affine transformations. We prove…
A partition polynomial is a refinement of the partition number p(n) whose coefficients count some special partition statistic. Just as partition numbers have useful asymptotics so do partition polynomials. In fact, their asymptotics…
Trace diagrams are structured graphs with edges labeled by matrices. Each diagram has an interpretation as a particular multilinear function. We provide a rigorous combinatorial definition of these diagrams using a notion of signed graph…
This paper solves the rational noncommutative analog of Hilbert's 17th problem: if a noncommutative rational function is positive semidefinite on all tuples of hermitian matrices in its domain, then it is a sum of hermitian squares of…
We study trace functions on the form $ t\to\tr f(A+tB) $ where $ f $ is a real function defined on the positive half-line, and $ A $ and $ B $ are matrices such that $ A $ is positive definite and $ B $ is positive semi-definite. If $ f $…
Our focus is upon {\it irreducible} nonnegative $n$-by-$n$ matrix realizations of nonnegatively realizable spectra or, equivalently, characteristic polynomials. After giving some general background, we make some useful new observations and…
We define tensors, corresponding to cubic polynomials, which have the same exponent $\omega$ as the matrix multiplication tensor. In particular, we study the symmetrized matrix multiplication tensor $sM_n$ defined on an $n\times n$ matrix…
We follow a stream of the history of positive matrices and positive functionals, as applied to algebraic sums of squares decompositions, with emphasis on the interaction between classical moment problems, function theory of one or several…
We show that there are Salem numbers of every trace. The nontrivial part of this result is for Salem numbers of negative trace. The proof has two main ingredients. The first is a novel construction, using pairs of polynomials whose zeros…
It is known that every complex square matrix with nonnegative determinant is the product of positive semi-definite matrices. There are characterizations of matrices that require two or five positive semi-definite matrices in the product.…
Let $\alpha$ be a totally positive algebraic integer, and define its absolute trace to be $\frac{Tr(\alpha)}{\text{deg}(\alpha)}$, the trace of $\alpha$ divided by the degree of $\alpha$. Elementary considerations show that the absolute…
Let M be an archimedean quadratic module of real t-by-t matrix polynomials in n variables, and let S be the set of all real n-tuples where each element of M is positive semidefinite. Our key finding is a natural bijection between the set of…
This is an expository article that results from a talk given to second year students at Oldenburg university. The aim of the talk was to show what beautiful and unexpected results may be obtained if one plays with daring analogies in a way…
Main result: If a C*-algebra is simple, $\sigma$-unital, has finitely many extremal traces, and has strict comparison of positive elements by traces, then its multiplier also has strict comparison of positive elements by traces. The same…
Let a and x denote tuples of (jointly) freely noncommuting variables. A square matrix valued polynomial p in these variables is naturally evaluated at a tuple (A,X) of symmetric matrices with the result p(A,X) a square matrix. The…
We generalize the notion of trace identity to $J$-trace. Our main result is that all $J$-traces of $M_{n,n}$ are consequence of those of degree $\frac12n(n + 3)$. This also gives an indirect description of the queer trace identities of…
An action trace is a function naturally associated to a probability measure preserving action of a group on a standard probability space. For countable amenable groups, we characterise stability in permutations using action traces. We…
We show that every real nonnegative polynomial $f$ can be approximated as closely as desired by a sequence of polynomials $\{f_\epsilon\}$ that are sums of squares. Each $f_\epsilon$ has a simple et explicit form in terms of $f$ and…
A symmetric tensor, which has a symmetric nonnegative decomposition, is called a completely positive tensor. We consider the completely positive tensor decomposition problem. A semidefinite algorithm is presented for checking whether a…