205 Documenta Math. Erratum for “Tropical Convexity”

Source URL: www.math.uiuc.edu

• Convex analysis
• Mike Develin
• Metric geometry
• Bernd Sturmfels
• Convex
• Metric space
• Polytope
• Convex lattice polytope

A centrally symmetric version of the cyclic polytope Alexander Barvinok ∗ Department of Mathematics,

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

• Geometry
• Mathematics
• Space
• Polyhedral combinatorics
• Polytopes
• Cyclic polytope
• Upper bound theorem
• Simplex
• Face
• 4-polytope
• Ehrhart polynomial

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

polymake: software for polytope constructions in linear and integer optimization Michael Joswig TU Berlin CO@Work, ZIB, 29 September 2015

Source URL: page.math.tu-berlin.de

Universality in Polytope Phase Transitions and Message Passing Algorithms Mohsen Bayati∗, Marc Lelarge†and Andrea Montanari ‡

Source URL: web.stanford.edu

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

SEMITORIC SYSTEMS WITH HYPERBOLIC SINGULARITIES HOLGER R. DULLIN School of Mathematics and Statistics, University of Sydney, Australia Toric integrable systems with their momentum maps whose images are rational polytope

Source URL: www.uantwerpen.be

Electronic Notes in Discrete Mathematics–1072 Finding Gale Strings Marta M. Casetti, Julian Merschen, Bernhard von Stengel Dept. of Mathematics, London School of Economics, London WC2A 2AE, United Kingd

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

• Mathematics
• Geometry
• Space
• Polytopes
• Topology
• Polyhedral combinatorics
• Game theory
• LemkeHowson algorithm
• Cyclic polytope
• Simplex
• Bimatrix game
• Simple polytope

MATHEMATICS OF OPERATIONS RESEARCH Vol. 28, No. 4, November 2003, pp. 871–883 Printed in U.S.A. LOWER BOUND FOR THE NUMBER OF ITERATIONS IN SEMIDEFINITE HIERARCHIES FOR THE CUT POLYTOPE

Source URL: homepages.cwi.nl