MathOverflow is a question and answer site for professional mathematicians. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Recently I learnt that $$ \inf\frac{diam(C)(per(C)-2diam(C))}{area(C)}=0$$ where the infimum is taken over all plane convex bodies $C$ (say, with non-zero area). In other words, there is no non-trivial (with $c>0$) inequality of the form $$diam(C)(per(C)-2diam(C))\geq c\cdot area(C),$$ that would hold for all $C$.

Now I'm wondering about inequalities of the form $$diam(C)(per(C)-(2-\epsilon)diam(C))\geq c_{\epsilon}\cdot area(C)$$ for $\epsilon>0$. Clearly, such an inequality is true for $c_\epsilon=\frac{4\epsilon}{\pi}$ (since $per(C)\geq2diam(C)$ and $diam(C)^2\geq4/\pi\cdot area(C)$).

The question is: what is the best $c_{\epsilon}$ for which the inequality holds? When would equality be achieved (it might depend on $\epsilon$)?

share|cite|improve this question

Let us call a circular segment a thing like this: (| :

I think that the best possible constant will be achieved on doubled circular segments, i.e. things like this : ()

Indeed suppose you fix the area and diameter of you domain, and try to minimise its perimeter. Then the diameter cuts your domain into two halves. If you fix the area of one half (and minimise its preimiter), then this is a classical fact that half will be a circular segment (|.

So one juts needs to take all the formulas from wiki (on the area and perimeter of circular segments) and find the minimum.

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.