4
$\begingroup$

Is there a system $\{s_1, \cdots, s_m\}$ of symmetric polynomials of $z_1, \cdots, z_n \in \mathbb{C}$ such that

$s_1(z_1, \cdots, z_n) = c_1$ $s_2(z_1, \cdots, z_n) = c_2$ $\cdots$ $s_m(z_1, \cdots, z_n) = c_m$

has at most one solution $(z_1, \cdots, z_n)$ up to permutation, for all choices $c_1, \cdots, c_m \in \mathbb{C}$?

If so, what is the minimum value of $m$? And what are all such systems of polynomials $\{s_1, \cdots, s_m\}$ with this property?

  • 0
    This origi$n$ated from http://stats.stackexcha$n$ge.co$m$/questions/8201/ if anyone is interested.2011-03-12

1 Answers 1

5

This is true whenever the $s_i$ generate the ring of symmetric functions since if you know the elementary symmetric polynomials $e_1, ... e_n$ in the $z_i$ you can write down a polynomial they satisfy. This is true, in particular, if the $s_i$ are

I know that the second can be replaced with "any $n$ consecutive power symmetric polynomials," and I would expect the third can as well. I don't know about more general characterizations; that seems like a hard problem. I think the minimum $m$ should be $n$.

  • 0
    The minimum should be exactly $n$. That's exactly what is meant by the statement that $m$ is at least $n$.2011-03-12