On convex polytopes in \(\mathbb R^{d}\) containing and avoiding zero

DOI10.1016/J.EJC.2012.11.001zbMATH Open1270.52016OpenAlexW2084707414MaRDI QIDQ1940364

Yanyan Li

Publication date: 6 March 2013

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2012.11.001

zbMATH Keywords

convex polytopeoriented matroidsimplexgeneral positionseparating hyperplane

Mathematics Subject Classification ID

(n)-dimensional polytopes (52B11) Inequalities and extremum problems involving convexity in convex geometry (52A40)

Recommendations

• Unnamed Item 👍 👎
• Unnamed Item 👍 👎
• Unnamed Item 👍 👎
• On \(k\)-convex polygons 👍 👎
• On \(0/1\)-polytopes with nonobtuse triangulations 👍 👎
• Upper bounds for configurations and polytopes in \({\mathbb{R}}^ d\) 👍 👎
• On the shape of \(p\)-convex hulls, \(0<p<1\) 👍 👎
• On empty convex polytopes 👍 👎
• The Lp Minkowski problem for polytopes for p<0 👍 👎
• On 0-1 polytopes with many facets 👍 👎

This page was built for publication: On convex polytopes in \(\mathbb R^{d}\) containing and avoiding zero