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.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.