Skip to main content Accessibility help

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
×
  1. Home
  2. Search

Refine search

Refine search

Access:
Content type:
Publication date:
Apply   From and To filters
Subject: Show more
Journals Show more
Publishers: Show more
Societies Show more
Series: Show more
Collections: Show more

Actions for selected content:

Select all | Deselect all
  • View selected items
  • Export citations
  • Download PDF (zip)
  • Save to Kindle
  • Save to Dropbox
  • Save to Google Drive

Save Search

You can save your searches here and later view and run them again in "My saved searches".

Please provide a title, maximum of 40 characters.
Cancel
×

1 results

  • The Brascamp–Lieb Polyhedron

  • Stefán Ingi Valdimarsson
  • Journal:
    Canadian Journal of Mathematics / Volume 62 / Issue 4 / 01 August 2010
    Published online by Cambridge University Press:
    20 November 2018, pp. 870-888
    Print publication:
    01 August 2010
    • Article
      • You have access
    • PDF
    • Export citation

  • 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.