The Brascamp-Lieb inequality in Convex Geometry and in the Theory of Algorithms
Fuente:
arXiv
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2024
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866916530469470208 |
|---|---|
| author | Böröczky, Károly J. |
| author_facet | Böröczky, Károly J. |
| contents | The Brascamp-Lieb inequality in harmonic analysis was proved by Brascamp and Lieb in the rank one case in 1976, and by Lieb in 1990. It says that in a certain inequality, the optimal constant can be determined by checking the inequality for centered Gaussian distributions. It was Keith M Ball's pioneering work around 1990 that led to various applications of the inequality in Convex Geometry, and even in Discrete Geometry, like Brazitikos' quantitative fractional version of the Helly Theorem. On the other hand, determining the optimal constant and possible Gaussian extremizers for the Brascamp-Lieb inequality can be formulated as a problem in terms of positive definite matrices, and this problem has intimate links to the Theory of Algorithms. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2412_11227 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | The Brascamp-Lieb inequality in Convex Geometry and in the Theory of Algorithms Böröczky, Károly J. Metric Geometry The Brascamp-Lieb inequality in harmonic analysis was proved by Brascamp and Lieb in the rank one case in 1976, and by Lieb in 1990. It says that in a certain inequality, the optimal constant can be determined by checking the inequality for centered Gaussian distributions. It was Keith M Ball's pioneering work around 1990 that led to various applications of the inequality in Convex Geometry, and even in Discrete Geometry, like Brazitikos' quantitative fractional version of the Helly Theorem. On the other hand, determining the optimal constant and possible Gaussian extremizers for the Brascamp-Lieb inequality can be formulated as a problem in terms of positive definite matrices, and this problem has intimate links to the Theory of Algorithms. |
| title | The Brascamp-Lieb inequality in Convex Geometry and in the Theory of Algorithms |
| topic | Metric Geometry |
| url | https://arxiv.org/abs/2412.11227 |