Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-17T15:03:58.757Z Has data issue: false hasContentIssue false

The Brascamp–Lieb Polyhedron

Published online by Cambridge University Press:  20 November 2018

Stefán Ingi Valdimarsson*
Affiliation:
UCLA Mathematics Department, Los Angeles, CA, U.S.A. and Science Institute, University of Iceland, Reykjavik, Iceland, e-mail: siv@hi.is
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

A set of necessary and sufficient conditions for the Brascamp–Lieb inequality to hold has recently been found by Bennett, Carbery, Christ, and Tao. We present an analysis of these conditions. This analysis allows us to give a concise description of the set where the inequality holds in the case where each of the linear maps involved has co-rank 1. This complements the result of Barthe concerning the case where the linear maps all have rank 1. Pushing our analysis further, we describe the case where the maps have either rank 1 or rank 2.

A separate but related problem is to give a list of the finite number of conditions necessary and sufficient for the Brascamp–Lieb inequality to hold. We present an algorithm which generates such a list.

Information

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 2010