Đề tài " An isoperimetric inequality for logarithmic capacity of polygons "

We verify an old conjecture of G. P´lya and G. Szeg˝ saying that the o o regular n-gon minimizes the logarithmic capacity among all n-gons with a fixed area. 1. Introduction The logarithmic capacity cap E of a compact set E in R2 , which we identify with the complex plane C, is defined by (1.1) − log cap E = lim (g(z, ∞) − log |z|), z→∞ where g(z, ∞) denotes the Green function of a connected component Ω(E) ∞ of C \ E having singularity at z = ∞; see [4, Ch. 7], [7, §11.1]. By an n-gon with...