English
Related papers

Related papers: Positive univariate trace polynomials

200 papers

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…

Rings and Algebras · Mathematics 2019-01-31 Jurij Volčič

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…

Combinatorics · Mathematics 2026-05-19 Hao Fang , Biao Ma

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…

Combinatorics · Mathematics 2021-11-25 Robert P. Boyer , Daniel Parry

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…

Combinatorics · Mathematics 2010-11-30 Steven Morse , Elisha Peterson

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…

Rings and Algebras · Mathematics 2021-08-23 Jurij Volčič

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 $…

Operator Algebras · Mathematics 2007-05-23 Frank Hansen

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…

Combinatorics · Mathematics 2026-05-25 C. R. Johnson , C. Marijuán , M. Pisonero

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…

Algebraic Geometry · Mathematics 2018-04-04 Luca Chiantini , Jonathan D. Hauenstein , Christian Ikenmeyer , J. M. Landsberg , Giorgio Ottaviani

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…

Functional Analysis · Mathematics 2007-05-23 John William Helton , Mihai Putinar

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…

Number Theory · Mathematics 2016-09-07 James McKee , Chris Smyth

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.…

Functional Analysis · Mathematics 2015-09-29 Jianlian Cui , Chi-Kwong Li , Nung-Sing Sze

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…

Number Theory · Mathematics 2022-08-09 Kyle Pratt , George Shakan , Alexandru Zaharescu

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…

Operator Algebras · Mathematics 2011-04-19 Igor Klep , Markus Schweighofer

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…

History and Overview · Mathematics 2007-11-05 Daniel Grieser

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…

Operator Algebras · Mathematics 2015-01-23 Victor Kaftal , Ping Ng , Shuang Zhang

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…

Functional Analysis · Mathematics 2017-06-21 Harry Dym , J. William Helton , Scott McCullough

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…

Rings and Algebras · Mathematics 2014-08-06 Allan Berele

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…

Group Theory · Mathematics 2024-12-13 Goulnara Arzhantseva , Liviu Paunescu

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…

Algebraic Geometry · Mathematics 2007-05-23 Jean B. Lasserre

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…

Optimization and Control · Mathematics 2014-11-20 Jinyan Fan , Anwa Zhou
‹ Prev 1 3 4 5 6 7 10 Next ›