The Slack Realization Space of a Polytope

DOI10.1137/18M1233649zbMath1423.52032arXiv1708.04739OpenAlexW2972937824WikidataQ127243591 ScholiaQ127243591MaRDI QIDQ5194621

João Gouveia, Rekha R. Thomas, Antonio Macchia, Amy Wiebe

Publication date: 16 September 2019

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1708.04739

zbMATH Keywords

polytopesrealizabilityslack matricesslack idealrealization spacesrational realizability

Mathematics Subject Classification ID

Polytopes and polyhedra (52B99)

Related Items

Slack Ideals in Macaulay2, Algebraic degrees of 3-dimensional polytopes, General non-realizability certificates for spheres with linear programming, ON THE DIMENSIONS OF THE REALIZATION SPACES OF POLYTOPES, Tropical positivity and determinantal varieties, Self-Dual Polyhedral Cones and Their Slack Matrices, Positive Plücker tree certificates for non-realizability, Combining realization space models of polytopes, Projectively unique polytopes and toric slack ideals, The slack realization space of a matroid, An algebraic approach to projective uniqueness with an application to order polytopes

Uses Software

• Macaulay2
• SageMath

Cites Work

• The complete enumeration of the 4-polytopes and 3-spheres with eight vertices
• Four-dimensional polytopes of minimum positive semidefinite rank
• Realizability of polytopes as a low rank matrix completion problem
• Universality theorems for inscribed polytopes and Delaunay triangulations
• Two ``simple 3-spheres
• Expressing combinatorial optimization problems by linear programs
• Constructions for projectively unique polytopes
• The universality theorem for neighborly polytopes
• Extension complexity and realization spaces of hypersimplices
• Two interesting oriented matroids
• Projectively unique polytopes and toric slack ideals
• The slack realization space of a matroid
• Which nonnegative matrices are slack matrices?
• Lower Bounds on the Size of Semidefinite Programming Relaxations
• Lectures on Polytopes
• Convex Polytopes
• The Matching Polytope has Exponential Extension Complexity
• Lifts of Convex Sets and Cone Factorizations
• Linear vs. semidefinite extended formulations