Skip to main content
added 18 characters in body; edited tags
Source Link

Fix $m,n\in\mathbb{N}$$m,n \in \mathbb{N}$ with $m\ge n+1$$m \ge n+1$. Take $m$ points in general position in $\mathbb{R}^n$ and let $P$ be their convex hull. What is the maximal number of (external, codimension-one) faces that $P$ can have, in terms of $m$ and $n$? (Apologies if this is a well-known quantity.)

(Apologies if this is a well-known quantity.)

Fix $m,n\in\mathbb{N}$ with $m\ge n+1$. Take $m$ points in general position in $\mathbb{R}^n$ and let $P$ be their convex hull. What is the maximal number of (external, codimension-one) faces that $P$ can have, in terms of $m$ and $n$? (Apologies if this is a well-known quantity.)

Fix $m,n \in \mathbb{N}$ with $m \ge n+1$. Take $m$ points in general position in $\mathbb{R}^n$ and let $P$ be their convex hull. What is the maximal number of (external, codimension-one) faces that $P$ can have, in terms of $m$ and $n$?

(Apologies if this is a well-known quantity.)

Source Link
zjs
  • 465
  • 4
  • 11

Polytope with most faces

Fix $m,n\in\mathbb{N}$ with $m\ge n+1$. Take $m$ points in general position in $\mathbb{R}^n$ and let $P$ be their convex hull. What is the maximal number of (external, codimension-one) faces that $P$ can have, in terms of $m$ and $n$? (Apologies if this is a well-known quantity.)