Perhaps you can assist me with some intuition. I'm looking for the number of zeros of
![](https://w3e.kanazawa-it.ac.jp/math/cgi-bin/mimetex1/mimetex.cgi?\reverse f_{m,n}(z) : = \frac{\mathrm{d}^m}{\mathrm{d}z^m}\left[\left(\frac{P(z)}{Q(z)}\right)^n\right])
, where
![](https://w3e.kanazawa-it.ac.jp/math/cgi-bin/mimetex1/mimetex.cgi?\reverse P(z))
and
![](https://w3e.kanazawa-it.ac.jp/math/cgi-bin/mimetex1/mimetex.cgi?\reverse Q(z))
are nonconstant polynomials with no common zeros, and
![](https://w3e.kanazawa-it.ac.jp/math/cgi-bin/mimetex1/mimetex.cgi?\reverse m,\,n)
are nonnegative integers. As an example, the case
![](https://w3e.kanazawa-it.ac.jp/math/cgi-bin/mimetex1/mimetex.cgi?\reverse P(z) = 2(z-1)^4(z-3)(z-7),\:Q(z) = (z+1)(z-2),\:m=0,\:n=5)
yields
![](https://w3e.kanazawa-it.ac.jp/math/cgi-bin/mimetex1/mimetex.cgi?\reverse f_{0,5}(z) = \frac{32(z-1)^{20}(z-3)^5(z-7)^5}{(z+1)^5(z-2)^5})
, which has thirty zeros (the zeros of the polynomial in the numerator).
For some convenient notation, let
![](https://w3e.kanazawa-it.ac.jp/math/cgi-bin/mimetex1/mimetex.cgi?\reverse p : = \deg{P(z)},\: q : = \deg{Q(z)})
and
![](https://w3e.kanazawa-it.ac.jp/math/cgi-bin/mimetex1/mimetex.cgi?\reverse Q(z) = A(z-z_1)(z-z_2)\dots (z-z_q))
, where
![](https://w3e.kanazawa-it.ac.jp/math/cgi-bin/mimetex1/mimetex.cgi?\reverse A)
is a complex number. I tried to decompose the rational function
![](https://w3e.kanazawa-it.ac.jp/math/cgi-bin/mimetex1/mimetex.cgi?\reverse f_{m,n}(z))
in terms of its poles as follows:
Here, the
![](https://w3e.kanazawa-it.ac.jp/math/cgi-bin/mimetex1/mimetex.cgi?\reverse C_{z_i,j})
are complex numbers, and
![](https://w3e.kanazawa-it.ac.jp/math/cgi-bin/mimetex1/mimetex.cgi?\reverse H_{m,n}(z))
is a polynomial of degree
![](https://w3e.kanazawa-it.ac.jp/math/cgi-bin/mimetex1/mimetex.cgi?\reverse \max\{(p-q)n-m,\,0\})
. Specifically, if
![](https://w3e.kanazawa-it.ac.jp/math/cgi-bin/mimetex1/mimetex.cgi?\reverse p\ge q)
and
![](https://w3e.kanazawa-it.ac.jp/math/cgi-bin/mimetex1/mimetex.cgi?\reverse 0\le m\le (p-q)n)
(which is precisely when
![](https://w3e.kanazawa-it.ac.jp/math/cgi-bin/mimetex1/mimetex.cgi?\reverse H_{m,n}(z))
does not vanish), we can write the terms in the right-hand side of equation
![](https://w3e.kanazawa-it.ac.jp/math/cgi-bin/mimetex1/mimetex.cgi?\reverse ( 1 ))
as a fraction with a common denominator, such that the polynomial
![](https://w3e.kanazawa-it.ac.jp/math/cgi-bin/mimetex1/mimetex.cgi?\reverse H_{m,n}(z)[(z-z_1)(z-z_2)\dots(z-z_q)]^{m+n})
dominates the degree in its numerator. Hence,
![](https://w3e.kanazawa-it.ac.jp/math/cgi-bin/mimetex1/mimetex.cgi?\reverse f_{m,n}(z))
has
![](https://w3e.kanazawa-it.ac.jp/math/cgi-bin/mimetex1/mimetex.cgi?\reverse (p-q)n-m+q(m+n) = pn + (q-1)m)
zeros in this case.
There seem to be two more distinct cases, but I'm not sure how to prove what the number of zeros is in them. The answer in those (remaining) cases should (probably, based on my numerical experiments) be
![](https://w3e.kanazawa-it.ac.jp/math/cgi-bin/mimetex1/mimetex.cgi?\reverse pn + (q-1)m)
if
and
![](https://w3e.kanazawa-it.ac.jp/math/cgi-bin/mimetex1/mimetex.cgi?\reverse q(m+n)-(m+1),)
if
![](https://w3e.kanazawa-it.ac.jp/math/cgi-bin/mimetex1/mimetex.cgi?\reverse p \ge q)
and
Any ideas?
"Stephen Wolfram is the creator of Mathematica and is widely regarded as the most important innovator in scientific and technical computing today." - Stephen Wolfram