<--- Back to Details
First PageDocument Content
Convex polytope / Arrangement of hyperplanes / Dual polyhedron / Simplex / Hypercube / Schlegel diagram / Ehrhart polynomial / Convex lattice polytope / Abstract polytope / Geometry / Polytopes / Regular polytope
Date: 2006-01-17 19:09:09
Convex polytope
Arrangement of hyperplanes
Dual polyhedron
Simplex
Hypercube
Schlegel diagram
Ehrhart polynomial
Convex lattice polytope
Abstract polytope
Geometry
Polytopes
Regular polytope

PCMI 2004 Graduate Summer School Overview Ezra Miller and Vic Reiner IAS/Park City Mathematics Series Volume 00, 0000

Add to Reading List

Source URL: www.math.duke.edu

Download Document from Source Website

File Size: 207,94 KB

Share Document on Facebook

Similar Documents

A C 1 Cross Polytope Macro-element in Four Variables Tatyana Sorokina Abstract. A C 1 macro-element in four variables is constructed based on a split of a cross polytope into sixteen simplices. The element uses

A C 1 Cross Polytope Macro-element in Four Variables Tatyana Sorokina Abstract. A C 1 macro-element in four variables is constructed based on a split of a cross polytope into sixteen simplices. The element uses

DocID: 1sSQZ - View Document

SUM OF SQUARES CERTIFICATES FOR CONTAINMENT OF H-POLYTOPES IN V-POLYTOPES KAI KELLNER AND THORSTEN THEOBALD Abstract. Given an H-polytope P and a V-polytope Q, the decision problem whether P is contained in Q is co-NP-co

SUM OF SQUARES CERTIFICATES FOR CONTAINMENT OF H-POLYTOPES IN V-POLYTOPES KAI KELLNER AND THORSTEN THEOBALD Abstract. Given an H-polytope P and a V-polytope Q, the decision problem whether P is contained in Q is co-NP-co

DocID: 1sIuk - View Document

CONTAINMENT PROBLEMS FOR POLYTOPES AND SPECTRAHEDRA KAI KELLNER, THORSTEN THEOBALD, AND CHRISTIAN TRABANDT Abstract. We study the computational question whether a given polytope or spectrahedron SA (as given by the posit

CONTAINMENT PROBLEMS FOR POLYTOPES AND SPECTRAHEDRA KAI KELLNER, THORSTEN THEOBALD, AND CHRISTIAN TRABANDT Abstract. We study the computational question whether a given polytope or spectrahedron SA (as given by the posit

DocID: 1sdVi - View Document

Fooling-sets and Rank in Nonzero Characteristic Dirk Oliver Theis University of Tartu Estonia

Fooling-sets and Rank in Nonzero Characteristic Dirk Oliver Theis University of Tartu Estonia

DocID: 1or9f - View Document

A BOUND FOR THE NUMBER OF VERTICES OF A POLYTOPE WITH APPLICATIONS Alexander Barvinok April 2012 Abstract. We prove that the number of vertices of a polytope of a particular kind

A BOUND FOR THE NUMBER OF VERTICES OF A POLYTOPE WITH APPLICATIONS Alexander Barvinok April 2012 Abstract. We prove that the number of vertices of a polytope of a particular kind

DocID: 1oePT - View Document