Take the 2-minute tour ×
MathOverflow is a question and answer site for professional mathematicians. It's 100% free, no registration required.

Suppose a polytope $P$ is contained in its dual polytope $\tilde{P}$. Does there always exist a polytope $Q$ that contains $P$ and is self dual $Q=\tilde{Q}$? Is there any bound on the minimal number of vertices that $Q$ should have given the number of vertices of $P$? Is there any algorithm for finding such a polytope?

The dual of a subset $A$ of a vector space $V$ is defined as $\tilde{A}:=\{\vec{y}\in V |\vec{y}\cdot\vec{x}\geq -c\; \forall \vec{x}\in A\}$, where $c$ is a given positive constant, and $\vec{y}\cdot\vec{x}$ is the scaler product between $\vec{y}$ and $\vec{x}$.

share|improve this question
Are there any references where this definition of self-dual is used. I believe the standard definition of self-dual is not this strict. –  Stephen Sturgeon Dec 5 '13 at 18:24

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.