相关论文: Computing Brascamp-Lieb Constants through the lens…
We consider two non-convex formulations for computing the optimal constant in the Brascamp-Lieb inequality corresponding to a given datum, and show that they are geodesically log-concave on the manifold of positive definite matrices endowed…
The celebrated Brascamp-Lieb (BL) inequalities (and their extensions) are an important mathematical tool, unifying and generalizing numerous inequalities in analysis, convex geometry and information theory. While their structural theory is…
By employing the recently obtained sharp stability versions of the Pr\'ekopa--Leindler inequality, we are able to obtain a sharp quantitative stability version for the Brascamp--Lieb inequality, as well as several different results on the…
Abstract H\"{o}lder-Brascamp-Lieb inequalities have become a ubiquitous tool in Fourier analysis in recent years, due in large part to a theorem of Bennett, Carbery, Christ, and Tao (2008,2010) characterizing finiteness of the…
We establish an effective upper bound for the Brascamp-Lieb constant associated to a weighted family of linear maps.
We establish a nonlinear generalisation of the classical Brascamp-Lieb inequality in the case where the Lebesgue exponents lie in the interior of the finiteness polytope. As a corollary we show that the best constant in Young's convolution…
We propose a new practical algorithm for computing the Feigenbaum constants {\alpha} and {\delta}, having significantly lower time and space complexity than previously used methods. The algorithm builds upon well-known linear algebra…
We prove that the best constant in the general Brascamp-Lieb inequality is a locally bounded function of the underlying linear transformations. As applications we deduce certain very general Fourier restriction, Kakeya-type, and nonlinear…
We prove a nonlinear variant of the general Brascamp-Lieb inequality. Instances of this inequality are quite prevalent in analysis, and we illustrate this with substantial applications in harmonic analysis and partial differential…
We present an algorithm for efficient computation of the constant term of a power of a multivariate Laurent polynomial. The algorithm is based on univariate interpolation, does not require the storage of intermediate data and can be easily…
Modeling of microlensing events poses computational challenges for the resolution of the lens equation and the high dimensionality of the parameter space. In particular, numerical noise represents a severe limitation to fast and efficient…
Recent progress in multilinear harmonic analysis naturally raises questions about the local behaviour of the best constant (or bound) in the general Brascamp--Lieb inequality as a function of the underlying linear transformations. In this…
We establish a structure theorem for the Brascamp--Lieb constant formulated in the general setting of locally compact abelian groups. This extends and unifies the finiteness characterisations previously known for euclidean spaces and for…
We propose a linear time and constant space algorithm for computing Euclidean projections onto sets on which a normalized sparseness measure attains a constant value. These non-convex target sets can be characterized as intersections of a…
H\"older-Brascamp-Lieb inequalities provide upper bounds for a class of multilinear expressions, in terms of $L^p$ norms of the functions involved. They have been extensively studied for functions defined on Euclidean spaces.…
We prove a reverse form of the multidimensional Brascamp-Lieb inequality. Our method also gives a new way to derive the Brascamp-Lieb inequality and is rather convenient for the study of equality cases.
We consider the Brascamp--Lieb inequalities concerning multilinear integrals of products of functions in several dimensions. We give a complete treatment of the issues of finiteness of the constant, and of the existence and uniqueness of…
Modern applications of strong gravitational lensing require the ability to use precise and varied observational data to constrain complex lens models. I discuss two sets of computational methods for lensing calculations. The first is a new…
This paper is devoted to introduce new geometric constants that quantify the difference between Roberts orthogonality and Birkhoff orthogonality in normed planes. We start by characterizing Roberts orthogonality in two different ways: via…
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…