Related papers: Globally trace-positive noncommutative polynomials…
It is known that for a completely positive and trace preserving (cptp) map ${\cal N}$, $\text{Tr}$ $\exp$$\{ \log \sigma$ $+$ ${\cal N}^\dagger [\log {\cal N}(\rho)$ $-\log {\cal N}(\sigma)] \}$ $\leqslant$ $\text{Tr}$ $\rho$ when $\rho$,…
We completely characterize sections of the cones of nonnegative polynomials, convex polynomials and sums of squares with polynomials supported on circuits, a genuine class of sparse polynomials. In particular, nonnegativity is characterized…
Let $f_1,...,f_s \in \mathbb{K}[x_1,...,x_m]$ be a system of polynomials generating a zero-dimensional ideal $\I$, where $\mathbb{K}$ is an arbitrary algebraically closed field. We study the computation of "matrices of traces" for the…
It is a result of Ginibre that the normalized bulk $k$-point correlation functions of a complex $n\times n$ Gaussian matrix with independent entries of mean zero and unit variance are asymptotically given by the determinantal point process…
We first obtain a trace formula for immanants of generalized principal submatrix of any complex matrix based on any weight space for finite dimensional representations of the general linear group. Our trace formula contains Kostant's famous…
Semi-Nonnegative Matrix Factorization (semi-NMF) extends classical Nonnegative Matrix Factorization (NMF) by allowing the basis matrix to contain both positive and negative entries, making it suitable for decomposing data with mixed signs.…
We introduce a remarkable new family of norms on the space of $n \times n$ complex matrices. These norms arise from the combinatorial properties of symmetric functions, and their construction and validation involve probability theory,…
Systems of polynomial equations over the complex or real numbers can be used to model combinatorial problems. In this way, a combinatorial problem is feasible (e.g. a graph is 3-colorable, hamiltonian, etc.) if and only if a related system…
Real algebraic geometry provides certificates for the positivity of polynomials on semi-algebraic sets by expressing them as a suitable combination of sums of squares and the defining inequalitites. We show how Putinar's theorem for…
Given a positive noncommutative polynomial $f$, equivalently a sum of Hermitian squares (SOHS), there exists a positive semidefinite Gram matrix that encrypts all the structural essence of $f$. There are no available methods for extending a…
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…
We study the trace set of the commutator subgroup of $\Gamma(2),$ a type of Local-Global problem about thin groups. We determine the local obstructions and then use the correspondence between binary quadratic forms and hyperbolic matrices…
Given a monic linear pencil L in g variables let D_L be its positivity domain, i.e., the set of all g-tuples X of symmetric matrices of all sizes making L(X) positive semidefinite. Because L is a monic linear pencil, D_L is convex with…
The deep interconnection between linear algebra and graph theory allows one to interpret classical matrix invariants through combinatorial structures. To each square matrix A over a commutative ring K, one can associate a weighted directed…
We equip the complex polynomial algebra C[t] with the involution which is the identity on C and sends t to -t. Answering a question raised by V.G. Kac, we show that every hermitian or skew-hermitian matrix over this algebra is congruent to…
Given a polynomial $x \in {\mathbb R}^n \mapsto p(x)$ in $n=2$ variables, a symbolic-numerical algorithm is first described for detecting whether the connected component of the plane sublevel set ${\mathcal P} = \{x : p(x) \geq 0\}$…
Efficient algorithms for many problems in optimization and computational algebra often arise from casting them as systems of polynomial equations. Blum, Shub, and Smale formalized this as Hilbert's Nullstellensatz Problem $HN_R$: given…
In the present paper, we prove the existence of universal polynomials which express multi-singularity loci classes of prescribed types for proper morphisms between smooth schemes over an algebraically closed field of characteristic zero --…
Results of Haagerup and Schultz (2009) about existence of invariant subspaces that decompose the Brown measure are extended to a large class of unbounded operators affiliated to a tracial von Neumann algebra. These subspaces are used to…
A matrix is called totally nonnegative (TN) if all its minors are nonnegative, and totally positive (TP) if all its minors are positive. Multiplying a vector by a TN matrix does not increase the number of sign variations in the vector. In a…