Pith. sign in

REVIEW

The Area of Polynomial Images and Preimages

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv math/0302189 v1 pith:GPNPCEW5 submitted 2003-02-17 math.CV math.CAmath.MG

The Area of Polynomial Images and Preimages

classification math.CV math.CAmath.MG
keywords areaboundcomplexinequalityplanepolynomialunderbounds
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original 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.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.