THE AREAS OF POLYNOMIAL IMAGES AND PRE-IMAGES
From MaRDI portal
Publication:4660460
Abstract: Let p be a monic polynomial in one complex variable and K a measurable subset of the complex plane. In terms of the area of K, we give an upper bound on the area of the preimage of K under p and a lower bound on the area of the image of K under p, (counted with multiplicity). Both bounds are sharp. The former extends an inequality of Polya. The proof uses Carleman's isoperimetric inequality for plane condensers. We include a summary of the necessary potential theory.
Recommendations
Cited in
(6)- On polynomials sharing preimages of compact sets, and related questions
- Preimages of \(p\)-linearized polynomials over \(\mathbb{F}_p\)
- The Image Containment Problem and Some Classes of Polynomial Instances
- Extremal polynomials in Smale's mean value conjecture
- Some recent results on the geometry of complex polynomials: the Gauss-Lucas theorem, polynomial lemniscates, shape analysis, and conformal equivalence
- Remez-type inequality for discrete sets
This page was built for publication: THE AREAS OF POLYNOMIAL IMAGES AND PRE-IMAGES
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4660460)