2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/95522We 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.27 pages, published versionComplex Variablestext