I've been looking for references/answers to this problem for several days and I couldn't find anything.
If we consider the closed unit ball $B$ in $\mathbb C^2$ then for any point $(z_1,z_2)\notin B$ we can find a polynomial $P$ of two variables with $$|P(z_1,z_2)|>\sup_{(w_1,w_2)\in B}|P(w_1,w_2)|.$$
In fact $P$ can be chosen to be just a line, but this statement written with polynomials is related to a more general theory of polynomially convex sets. See for instance https://www.encyclopediaofmath.org/index.php/Polynomial_convexity.
My question is, can we find $P$ being symmetric i.e. $P(w_1,w_2)=P(w_2,w_1)$ for all $w_1,w_2\in\mathbb C$?
I found a non-costructive proof of the result but it uses several strong results. However, the question can be easily solved if we consider the polydisc of center zero and radius one instead of $B$. We can consider the polynomial $P_n(w_1,w_2)=w_1^n+w_2^n$ with $n$ big enough such that the argument of $z_1$ and $z_2$ is almost the same. However, this argument does not work for $B$ since we can have that $z_1$ and $z_2$ both have modulus smaller than one, and as a consequence when $p$ is big the values of the polynomials $P_n$ go to zero at $(z_1,z_2)$.
Any reference would be appreciated. Thanks in advance.