Sharp bounds for the p-torsion of convex planar domains

Details Sharp bounds for the p-torsion of convex planar domains Sharp bounds for the p-torsion of convex planar domains

2011-12-21

arxiv.org/abs/1112.5050v1

Mathematics

Optimization and Control

Scientific paper

We obtain some sharp estimates for the $p$-torsion of convex planar domains in terms of their area, perimeter, and inradius. The approach we adopt relies on the use of web functions (i.e. functions depending only on the distance from the boundary), and on the behaviour of the inner parallel sets of convex polygons. As an application of our isoperimetric inequalities, we consider the shape optimization problem which consists in maximizing the $p$-torsion among polygons having a given number of vertices and a given area. A long-standing conjecture by P\'olya-Szeg\"o states that the solution is the regular polygon. We show that such conjecture is true within the subclass of polygons for which a suitable notion of "asymmetry measure" exceeds a critical threshold.

Affiliated with

Also associated with

No associations

Rating

Sharp bounds for the p-torsion of convex planar domains 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 Sharp bounds for the p-torsion of convex planar domains, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Sharp bounds for the p-torsion of convex planar domains will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-193125