Related papers: Noncommutative Plurisubharmonic Polynomials Part I…
We analyze the structure of the algebra N of symmetric polynomials in non-commuting variables in so far as it relates to its commutative counterpart. Using the "place-action" of the symmetric group, we are able to realize the latter as the…
Hunter proved that the complete homogeneous symmetric polynomials of even degree are positive definite. We prove a noncommutative generalization of this result, in which the scalar variables are replaced with hermitian operators. We provide…
The theory of symmetric functions has been extended to the case where each variable is paired with an anticommuting one. The resulting expressions, dubbed superpolynomials, provide the natural N=1 supersymmetric version of the classical…
We show that various identities from [1] and [3] involving Gould-Hopper polynomials can be deduced from the real but also complex orthogonal invariance of multivariate Gaussian distributions. We also deduce from this principle a useful…
Let $f_1, f_2, ..., f_n$ be a family of independent copies of a given random variable f in a probability space $(\Omega, \mathcal{F}, \mu)$. Then, the following equivalence of norms holds whenever $1 \le q \le p < \infty$…
Noncommutative invariant theory is a generalization of the classical invariant theory of the action of $SL(2,\IC)$ on binary forms. The dimensions of the spaces of invariant noncommutative polynomials coincide with the numbers of certain…
Superpolynomials consist of commuting and anti-commuting variables. By considering the anti-commuting variables as a module of the symmetric group the theory of vector-valued nonsymmetric Jack polynomials can be specialized to…
We show that the monodromy theorem holds on arbitrary connected free sets for noncommutative free analytic functions. Applications are numerous-- pluriharmonic free functions have globally defined pluriharmonic conjugates, locally…
Using a noncommutative analog of Chevalley's decomposition of polynomials into symmetric polynomials times coinvariants due to Bergeron, Reutenauer, Rosas, and Zabrocki we compute the graded Frobenius series for their two sets of…
On the set of complex number $\mathbb{C}$ it is possible to define $n$-valued group for any positive integer $n$. The $n$-multiplication defines a symmetric polynomial $p_n = p_n(x, y, z)$ with integer coefficients. By the theorem on…
The so-called Frobenius number in the famous linear Diophantine problem of Frobenius is the largest integer such that the linear equation $a_1 x_1+\cdots+a_k x_k=n$ ($a_1,\dots,a_k$ are given positive integers with $\gcd(a_1,\dots,a_k)=1$)…
By a result of Helton and McCullough, open bounded convex free semialgebraic sets are exactly open (matricial) solution sets D_L of a linear matrix inequality (LMI) L(X)>0. This paper gives a precise algebraic certificate for a polynomial…
This paper analyses a Waring type decomposition of a noncommuting (NC) polynomial $p$ with respect to the goal of evaluating $p$ efficiently on tuples of matrices. Such a decomposition can reduce the number of matrix multiplications needed…
Extending Eulerian polynomials and Faulhaber's formula 1, we study several combi-natorial aspects of harmonic sums and polylogarithms at non-positive multi-indices as well as their structure. Our techniques are based on the combinatorics of…
We establish operator-valued versions of the earlier foundational factorization results for noncommutative polynomials due to Helton (Ann.~Math., 2002) and one of the authors (Linear Alg.~Appl., 2001). Specifically, we show that every…
Most integers are composite and most univariate polynomials over a finite field are reducible. The Prime Number Theorem and a classical result of Gau{\ss} count the remaining ones, approximately and exactly. For polynomials in two or more…
We introduce new polynomial invariants of a finite-dimensional semisimple and cosemisimple Hopf algebra A over a field by using the braiding structures of A. We investigate basic properties of the polynomial invariants including stability…
We study the ring of quasisymmetric polynomials in $n$ anticommuting (fermionic) variables. Let $R_n$ denote the polynomials in $n$ anticommuting variables. The main results of this paper show the following interesting facts about…
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…
The symmetric function theorem states that a polynomial that is invariant under permutation of variables, is a polynomial in the elementary symmetric polynomials. We deduce this classical result, in the analytic setting, from the…