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

Source URL: www.math.utah.edu

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

Source URL: www.math.uni-frankfurt.de

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

Source URL: www.math.uni-frankfurt.de

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

Source URL: www.math.uni-magdeburg.de

• Linear algebra
• Matrix theory
• Matrices
• Matrix
• Rank
• Polytopes
• Abstract polytope
• PerronFrobenius theorem

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

Source URL: www.math.lsa.umich.edu

• Polytopes
• Orbifold
• PerronFrobenius theorem

New Lower Bounds for the Number of Equilibria in Bimatrix Games Bernhard von Stengel ∗ ETH Z¨ urich

Source URL: www.maths.lse.ac.uk

• Polyhedral combinatorics
• Polytopes
• Polyhedra
• Convex geometry
• Real algebraic geometry
• Face
• Vertex enumeration problem
• Upper bound theorem
• Cyclic polytope
• LemkeHowson algorithm
• Abstract polytope

HOW NEIGHBORLY CAN A CENTRALLY SYMMETRIC POLYTOPE BE? NATHAN LINIAL AND ISABELLA NOVIK Abstract. We show that there exist k-neighborly centrally symmetric ddimensional polytopes with 2(n + d) vertices, where „

Source URL: www.math.washington.edu

Explicit constructions of centrally symmetric k-neighborly polytopes and large strictly antipodal sets Alexander Barvinok ∗

Source URL: www.math.lsa.umich.edu

• Polyhedral combinatorics
• Polytopes
• Neighborly polytope
• Moment curve
• Cyclic polytope
• Abstract polytope

Econometrica, Vol. 74, No. 2 (March, 2006), 397–429 HARD-TO-SOLVE BIMATRIX GAMES BY RAHUL SAVANI AND BERNHARD VON STENGEL1 The Lemke–Howson algorithm is the classical method for finding one Nash equilibrium of a bim

Source URL: www.maths.lse.ac.uk

• Game theory
• LemkeHowson algorithm
• Bimatrix game
• Nash equilibrium
• Symmetric equilibrium
• Symmetric game
• Zero-sum game
• Strategy
• Polytope
• Risk dominance
• Abstract polytope

Discrete Comput Geom 21:557–Discrete & Computational Geometry

Source URL: www.maths.lse.ac.uk

• Polytopes
• Expansion
• Simplex
• Face
• Cyclic polytope
• Abstract polytope
• Regular polytope