The reverse isoperimetric inequality for convex shapes included in a triangle
math.MG
Submitted: 2026-10-26
Updated: 2026-10-26
License: http://creativecommons.org/licenses/by/4.0/
The gist: We establish a sharp reverse isoperimetric inequality for convex subsets of a triangle under a prescribed area constraint.
Abstract
We establish a sharp reverse isoperimetric inequality for convex subsets of a triangle under a prescribed area constraint. Given a triangle T and an area fraction η in(0,1), we determine the set with maximal perimeter among convex bodies K T satisfying K=ηT and characterize the equality cases. Every maximizer is a triangle, and the optimal configuration is obtained by retaining a longest side of T and placing the third vertex on a shortest side, at the position determined by the area constraint. This characterization yields an explicit expression for the maximal perimeter in terms of η and the side lengths of T.
Related papers
- Axis-parallel square packing with an exact formula for optimal packing of seven squares
- The microscopic weighting on a metric space
- Unrectifiable surfaces with intrinsic regularity in Carnot groups
- Monge's transport problem in synthetic Lorentzian spacetimes
- The packing spectrum: interpolation between Hausdorff and packing dimensions
- Quasiconformal uniformization and extension for planar trees