An isoperimetric inequality for logarithmic capacity of polygons
classification
🧮 math.CV
keywords
capacitylogarithmicareaconjecturefixedinequalityisoperimetricminimizes
read the original abstract
We verify an old conjecture of G. Polya and G. Szego saying that the regular n-gon minimizes the logarithmic capacity among all n-gons with a fixed area.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.