Related papers: Schur polynomials and matrix positivity preservers
Artin solved Hilbert's 17th problem, proving that a real polynomial in $n$ variables that is positive semidefinite is a sum of squares of rational functions, and Pfister showed that only $2^n$ squares are needed. In this paper, we…
We study certain Schur functors which preserve singularity categories of rings and we apply them to study the singularity category of triangular matrix rings. In particular, combining these results with Buchweitz-Happel's theorem, we can…
This survey contains a selection of topics unified by the concept of positive semi-definiteness (of matrices or kernels), reflecting natural constraints imposed on discrete data (graphs or networks) or continuous objects (probability or…
Convolution admits a natural formulation as a functional operation on matrices. Motivated by the functional and entrywise calculi, this leads to a framework in which convolution defines a matrix transform that preserves positivity. Within…
We represent Mat\'ern functions in terms of Schoenberg's integrals which ensure the positive definiteness and prove the systems of translates of Mat\'ern functions form Riesz sequences in $L^2(\R^n)$ or Sobolev spaces. Our approach is based…
Many eigenvalue matrix models possess a peculiar basis of observables which have explicitly calculable averages. This explicit calculability is a stronger feature than ordinary integrability, just like the cases of quadratic and Coulomb…
Edelman and Greene generalized the Robinson--Schensted--Knuth correspondence to reduced words in order to give a bijective proof of the Schur positivity of Stanley symmetric functions. Stanley symmetric functions may be regarded as the…
We give a combinatorial expansion of the stable Grothendieck polynomials of skew Young diagrams in terms of skew Schur functions, using a new row insertion algorithm for set-valued semistandard tableaux of skew shape. This expansion unifies…
The nonnegative and positive semidefinite (PSD-) ranks are closely connected to the nonnegative and positive semidefinite extension complexities of a polytope, which are the minimal dimensions of linear and SDP programs which represent this…
We establish a new description of the Schur-Agler norm of a holomorphic function on the polydisc as the solution of a convex optimization problem. Consequences of this description are explored both from a theoretical and from a practical…
A complexified Heisenberg matrix group $\mathrm{H}_\mathbb{C}$ with entries from an infinite-dimensional Hilbert space $H$ is investigated. The Weyl--Schr\"odinger type irreducible representations of $\mathrm{H}_\mathbb{C}$ on the space…
We obtain in closed form averages of polynomials, taken over hermitian matrices with the Gaussian measure involved in the Kontsevich integral, and prove a conjecture of Witten enabling one to express analogous averages with the full (cubic…
We prove that for arbitrary partitions $\mathbf{\lambda} \subseteq \mathbf{\kappa},$ and integers $0\leq c<r\leq n,$ the sequence of Schur polynomials $S_{(\mathbf{\kappa} + k\cdot \mathbf{1}^c)/(\mathbf{\lambda} + k\cdot…
The properties of matrix valued polynomials generated by the scalar-type Rodrigues' formulas are analyzed. A general representation of these polynomials is found in terms of products of simple differential operators. The recurrence…
We establish various certifying determinantal representation results for a polynomial that contains as a factor a prescribed multivariable polynomials that is strictly stable on a tube domain. The proofs use a Cayley transform in…
We use earlier defined notion of $n$- determinant to investigate sub-determinants of an extended Vandermonde matrix. Firstly, we demonstrate our method on a number of particular cases. Then we prove that all these results may be stated in…
We show that Griffiths' multivariate Meixner polynomials occur as matrix coefficients of holomorphic discrete series representations of the group $\mathrm{SU}(1,d)$. Using this interpretation we derive several fundamental properties of the…
We present a hierarchy of semidefinite programs (SDPs) for the problem of fitting a shape-constrained (multivariate) polynomial to noisy evaluations of an unknown shape-constrained function. These shape constraints include convexity or…
When one expands a Schur function in terms of the irreducible characters of the symplectic (or orthogonal) group, the coefficient of the trivial character is 0 unless the indexing partition has an appropriate form. A number of q-analogues…
We prove a quantitative version of the Polynomial Szemeredi Theorem for difference sets. This result is achieved by first establishing a higher dimensional analogue of a theorem of Sarkozy (the simplest non-trivial case of the Polynomial…