Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Maybe it is not a standard term, a harmonic polynomial is $h_{n,m}(z,\bar{z})=f_n(z)+\overline{g_m(z)}$ where $f$ and $g$ are polynomials in $z\in\mathbb{C}$ of degrees $n,m$ respectively.We may assume that $n\geq m$.

Then how many roots of the equation $h_{n,m}(z,\bar{z})=0$ are there?

I heard a saying that it has at least $n$ roots using $\textit{Argument Principle}$.

Is it right?I do not know how to apply this theorem.I have a test on $z^2-\bar{z}=0$,$z^2-\bar{z}+1=0$.In these cases the conclusion holds.But I do not know how to get the general result.

Will someone be kind enough to give me some hints on this problem?And will someone be kind enough to show me how to solve such equations on $\textit{Mathematica}$?

Thank you very much!

share|cite|improve this question

You are right if either $n>m$ or $n=m$ and the top degree coefficients of $f$ and $g$ have different absolute values (the roots have to be counted with their multiplicities, of course). However, $z^2+z+1+\bar z^2$, say, has no roots because every root $z$ must be real ($z^2+\bar z^2$ is always real) but $2x^2+x+1>0$ for all $x\in\mathbb R$.

share|cite|improve this answer
Thank you for your counterexample!But can you give me some more hints on your first statement?Thank you very much! – user14242 Jan 12 '12 at 13:19

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.