An isoperimetric inequality for logarithmic capacity of polygons

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.

arXiv comment27 pages, published version