Minimize Perimeter(S)/Area(S) for S inside the unit square. - MathOverflow

Minimize Perimeter(S)/Area(S) for S inside the unit square.

2009-11-11T06:15:47Z

This is a very silly question.

For all regions S contained inside the unit square, what is the infimum of the quantity Perimeter(S)/Area(S)? This ratio being considered is not scale invariant, so it is only the constraint of being contained within the square which implies that this infimum is non-zero.

There are some "obvious" configurations to try, but I do not even know how to use a calculus of variations argument to show that these are local maxima.

Can one do better than $\displaystyle{2 + \sqrt{\pi}}$?

EDIT: One can probably show that an optimal S has $\mathbf{Z}/4\mathbf{Z}$ symmetry. Assume that S consists of line segments along part of boundary, leaving segments of length x at each corner, and then (four quarters of) a shape T in the corner. We can assume that T has volume Ax^2 and perimeter Px. Minimizing the quantity with respect to x, one obtains a minimum of:

$$2 +\sqrt{4 + \frac{(P/2-4)^2}{(A - 4)}},$$

which becomes $2 + \sqrt{\pi}$ when T is the circle, i.e., $A = \pi$ and $P = 2 \pi$.

Answer by Yemon Choi for Minimize Perimeter(S)/Area(S) for S inside the unit square.

2009-11-11T07:06:52Z

The only hand-wavy suggestion I have towards finding extrema is that if S is a subset of the unit square then replacing S with its convex hull ought not to increase the ratio you're trying to minimize, and should strictly decrease it if the original set S was non-convex.

Have you tried feeding |x|^p + |y|^p = 1 into something like Maple/Mathematica, for p > 1, and getting it to compute the desired quantity for the set bounded by that curve?

Answer by David Speyer for Minimize Perimeter(S)/Area(S) for S inside the unit square.

2009-11-11T15:30:55Z

Basic observation: the solution will consist of circular arcs joining the sides of the square to each other, and some sides of the square.

Lemma: Consider a line segment of length $\ell$, and real number $p \geq \ell$. Consider all planar regions which contain the line segment in their boundary, and for which the rest of their boundary has length $p$. The largest possible area of such a region is obtained when the nonlinear part of the boundary is a circular arc.

Proof: Otherwise, we could take a circle, draw a chord of length $\ell$ across it cutting off an arc of length $p$, and replace this segment by another shape, to obtain a shape with the same perimeter as the circle and larger area.

Using the basic observation, your problem turns from a problem in the calculus of variations to one in multivariable calculus: mark the 8 points at which your shape leaves the sides of the square, and the radii of the 4 circles which cut the corners. Since, as you observed, the solution has eight-fold symmetry, there are really just two quantities: the length of the four boundary segments and the radius (or the angle) of the arcs cutting the corners.

Answer by Enea for Minimize Perimeter(S)/Area(S) for S inside the unit square.

2012-05-22T17:53:35Z

This is known as the Cheeger problem, you can have a look at the paper "An introduction to the Cheeger problem" (http://www.utgjiu.ro/math/sma/v06/a02.html) and references therein.