Hermitian symmetric polynomials and CR complexity (Q555694): Difference between revisions

A polynomial \(p(z,\bar{w})\) (\(z,w\in\mathbb{C}^n\)) is Hermitian when \(p(z,\bar{z})\) is real valued. In this case \(p(z,\bar{w})={\sum}c_{\alpha,\beta} z^\alpha\bar{w}^\beta\) for a Hermitian symmetric matrix \((c_{\alpha,\beta})\). Its signature \(\mathbf{s}(p)=(A,B)\) is uniquely determined and there are polynomial mappings \(f:\mathbb{C}^n\to\mathbb{C}^A\) and \(g:\mathbb{C}^n\to\mathbb{C}^B\) such that \(p(z,\bar{z})=\|f(z)\|^2-\|g(z)\|^2\). To investigate the relationship between the zero set of \(p\) and the matrix \((c_{\alpha,\beta})\) it is important to consider the Hermitian matrices arising from operations on the Hermitian polynomials. Here the authors investigate the signature of a product. They show that there are indefinite Hermitian polynomials \(p_1,p_2\) with \(\mathbf{s}(p_1p_2)\) matching any possible \((A,B)\), with the exception of the trivial cases \((0,0)\), \((0,1)\), \((1,0)\). They also show that one can get \(\mathbf{s}(p_1p_2)=(2,0)\) for \(p_1\) and \(p_2\) of arbitrarily large rank. Application to \(CR\) geometry requires to analyze the signature and the rank of all possible multiples of a fixed polynomial. Hermitian symmetric polynomials are related to \(CR\) maps of hyperquadrics, e.g. to a rational map \(S^{2n-1}\to{S}^{2N-1}\), written as the quotient \(f/g\) of a polynomial map \(f\) and a polynomial \(g\) corresponds the Hermitian symmetric polynomial \(\|f\|^2-|g|^2\). Exploiting this correspondence, the authors investigate \(CR\) maps between hyperquadrics, getting fairly complete results for maps from \(S^3\) and proving some stability result in higher dimension.