The polynomial $p(\xi_1, \xi_2) = -\xi_1\xi_2^2$ has infinitely many roots, because either $\xi_1$ or $\xi_2$ can be $0$, there is no requirement that both are $0$. So, the set of roots of $p$ is $$\{(\xi_1, \xi_2)|\xi_1=0\lor \xi_2=0\} =(\mathbb C\times \{0\})\cup (\{0\}\times \mathbb C)$$
which is a union of two infinite sets, and therefore infinite.
In general, a complex polynomial in $n$ variables has infinitely many roots, assuming the following:
- $n > 1$
- The degree of the polynomial is not $0$ (i.e. the polynomial is not constant)
You can see that for yourself if you think of the polynomial as a parametrized polynomial of one variable.
Let's stick to $n=2$ for now. Take a polynomial $p(\xi_1,\xi_2)$. We can assume WLOG that the polynomial is not constant in $\xi_1$. Now, define $p_{\xi_2}$ to be the polynomial of one variable, defined as $p_{\xi_2}(z)=p(z, \xi_2)$.
For all but a finite selection of $\xi_2$, the polynomial $p_{\xi_2}$ is now a complex polynomial, and as such it has a root. In other words, $p_0$ has a root, $p_1$ has a root, $p_i$ has a root and so on. So, let's call $z_{\xi_2}$ the root of $p_{\xi_2}$. Then the set $$\{(z_{\xi_2}, \xi_2)|\xi_2\in\mathbb Z\}$$ is both infinite and a subset of the set of all roots of $p$.
If $n>2$, then you can start with a polynomial $q:\mathbb C^n\to \mathbb C$ and first define the polynomial $p:\mathbb C^2\to \mathbb C$ as $p(\xi_1,\xi_2)=q(\xi_1,\xi_2,0,\dots,0)$ and use the same argument as above (assuming, again WLOG, that $\xi_1$ does not have degree $0$ in $q$).