2019-03-12 16:45:28 8 Comments

Consider the set $\mathbb{R}^{m \times n}$ of $m \times n$ matrices. I am particularly interested in properties of polytope $P$ defined as a convex hull of all $\{-1,1\}$ matrices of rank $1$, that is,

$$ P = \mbox{conv} \{ uv^T : u \in \{-1,1\}^m, v \in \{-1,1\}^n \}. $$

In particular, I would like to know how all ($mn-1$)-dimensional faces of this polytope and the corresponding normals can be described. Is there any research on that? Maybe this polytope has a name or belongs to a nontrivial class I could find research on?

### Related Questions

#### Sponsored Content

#### 0 Answered Questions

### Name for facet of a cone containing all but one edge

**2018-12-31 11:39:23****Allen Knutson****83**View**4**Score**0**Answer- Tags: reference-request convex-polytopes terminology polyhedra cones

#### 2 Answered Questions

### [SOLVED] Convex hull of the Stiefel manifold with non-negativity constraints

**2018-04-03 15:24:50****Mahdi****347**View**11**Score**2**Answer- Tags: convex-geometry convexity convex-optimization convex-hulls

#### 1 Answered Questions

### [SOLVED] On faces of convex sets of positive semidefinite matrices

**2018-02-15 07:30:31****DBB****257**View**5**Score**1**Answer- Tags: matrices convex-geometry matrix-analysis convex-analysis

#### 0 Answered Questions

### intriguing Polytope

**2017-11-15 09:35:27****Rémy Martin****186**View**8**Score**0**Answer- Tags: gr.group-theory convex-polytopes permutations

#### 0 Answered Questions

### What is an umbilic point of a convex polyhedron?

**2017-10-16 20:31:26****Mohammad Ghomi****93**View**1**Score**0**Answer- Tags: reference-request dg.differential-geometry convex-polytopes convex-geometry open-problems

#### 2 Answered Questions

### [SOLVED] Convex hull of total orders

**2014-06-13 16:51:47****Mostafa****612**View**25**Score**2**Answer- Tags: co.combinatorics convex-polytopes convex-hulls

#### 0 Answered Questions

### Finding optimal linear transformation for intersection of convex polytopes

**2015-08-11 06:57:02****Artemy****125**View**2**Score**0**Answer- Tags: linear-algebra convex-polytopes convex-geometry linear-programming convex-optimization

#### 1 Answered Questions

### [SOLVED] Characterizing invertible nonnegative matrices with bounded sums

**2011-10-08 18:22:51****Suvrit****537**View**5**Score**1**Answer- Tags: linear-algebra matrices nonnegative-matrices fa.functional-analysis

#### 1 Answered Questions

### [SOLVED] Study of convex polytopes via commutative algebra

**2014-03-12 12:49:46****Erik Friese****450**View**4**Score**1**Answer- Tags: reference-request ac.commutative-algebra discrete-geometry convex-polytopes semigroups-and-monoids

#### 1 Answered Questions

### [SOLVED] The facial structure of the convex hull of a family of characteristic functions

**2012-04-07 20:58:07****Pietro Majer****220**View**3**Score**1**Answer- Tags: convex-polytopes co.combinatorics measure-theory reference-request

## 1 comments

## @Guillaume Aubrun 2019-03-19 11:03:54

That polytope $P_{m,n}$ appears under many names : correlation polytope, Bell polytope, local hidden variable polytope, local polytope (sometimes these names refer to slightly different polytopes), and probably more. It is the unit ball for the projective norm on $\ell_{\infty}^m \otimes \ell_{\infty}^n$.

The facial structure of $P_{m,n}$ has attracted a lot of attention since 1-codimensional faces of $P_{m,n}$ are in 1-1 correspondance with Bell inequalities from quantum physics. See for example that website (restrict to $N=2$ if you want to consider only matrices and not higher order tensors).

Besides small values of $m$, $n$ a complete description of faces seems out of reach. It follows from general considerations on the complexity of polytopes that the number of faces of $P_{m,n}$ has to grow at least exponentially in $\min(m,n)$, which somehow explains that the facial structure is complicated. The order of growth of the number of faces of $P_{n,n}$ seems unknown (is it exponential in $n$, or super-exponential?). You can look at chapter 11.2 of our book "Alice and Bob meet Banach" for more information.