The Brascamp-Lieb inequality in Convex Geometry and in the Theory of Algorithms

2024/12/15 by Károly J. Böröczky, Böröczky, Károly J. · 1 citation
Mathematics · Computer Science · #Point processes and geometric inequalities #Topological and Geometric Data Analysis #Digital Image Processing Techniques

paper · pdf · doi:10.48550/arxiv.2412.11227

Abstract

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.

Cited by

• Equality in Liakopoulos's generalized dual Loomis-Whitney inequality via Barthe's Reverse Brascamp-Lieb inequality

Related

• Regularized Brascamp--Lieb inequalities
• Euclidean Forward-Reverse Brascamp-Lieb Inequalities: Finiteness,\n Structure and Extremals
• Algorithmic and optimization aspects of Brascamp-Lieb inequalities, via\n Operator Scaling
• The nonlinear Brascamp-Lieb inequality for simple data
• The Brascamp-Lieb inequality and its influence on Fourier analysis