Pairing between zeros and critical points of random polynomials with independent roots

Abstract: Let

p_{n}

be a random, degree

n

polynomial whose roots are chosen independently according to the probability measure

m u

on the complex plane. For a deterministic point

x i

lying outside the support of

m u

, we show that almost surely the polynomial

q_{n} (z) := p_{n} (z) (z - x i)

has a critical point at distance

O (1 / n)

from

x i

. In other words, conditioning the random polynomials

p_{n}

to have a root at

x i

, almost surely forces a critical point near

x i

. More generally, we prove an analogous result for the critical points of

q_{n} (z) := p_{n} (z) (z - x i_{1}) c d o t s (z - x i_{k})

, where

x i_{1}, l d o t s, x i_{k}

are deterministic. In addition, when

k = o (n)

, we show that the empirical distribution constructed from the critical points of

q_{n}

converges to

m u

in probability as the degree tends to infinity, extending a recent result of Kabluchko.

Recommendations

Cites work

Cited in

(24)

This page was built for publication: Pairing between zeros and critical points of random polynomials with independent roots