Three quantitative versions of the Pál inequality

Fuente: arXiv
Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Lucardesi, Ilaria, Zucco, Davide
Format: Preprint
Veröffentlicht: 2024
Schlagworte:
Online-Zugang:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866909537656635392
author Lucardesi, Ilaria
Zucco, Davide
author_facet Lucardesi, Ilaria
Zucco, Davide
contents The Pál inequality is a classical result which asserts that among all planar convex sets of given width the equilateral triangle is the one of minimal area. In this paper we prove three quantitative versions of this inequality, by quantifying how the closeness of the area of a convex set, of certain width, to the minimal value implies its closeness to the equilateral triangle. As a by-product, we also present a novel result concerning a quantitative inequality for the inradius of a set, under minimal width constraint.
format Preprint
id arxiv_https___arxiv_org_abs_2405_18294
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Three quantitative versions of the Pál inequality
Lucardesi, Ilaria
Zucco, Davide
Metric Geometry
Optimization and Control
The Pál inequality is a classical result which asserts that among all planar convex sets of given width the equilateral triangle is the one of minimal area. In this paper we prove three quantitative versions of this inequality, by quantifying how the closeness of the area of a convex set, of certain width, to the minimal value implies its closeness to the equilateral triangle. As a by-product, we also present a novel result concerning a quantitative inequality for the inradius of a set, under minimal width constraint.
title Three quantitative versions of the Pál inequality
topic Metric Geometry
Optimization and Control
url https://arxiv.org/abs/2405.18294