Mathematics – Complex Variables
Scientific paper
2005-10-06
Ann. of Math. (2), Vol. 159 (2004), no. 1, 277--303
Mathematics
Complex Variables
27 pages, published version
Scientific paper
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.
Solynin Alexander Yu.
Zalgaller Victor A.
No associations
LandOfFree
An isoperimetric inequality for logarithmic capacity of polygons does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with An isoperimetric inequality for logarithmic capacity of polygons, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An isoperimetric inequality for logarithmic capacity of polygons will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-324422