Complex psd-minimal polytopes in dimensions two and three
DOI10.1142/s0219498824500257zbMath1528.05003arXiv2110.08158OpenAlexW3206930359MaRDI QIDQ6089230
Tristram C. Bogart, Juan Camilo Torres, João Gouveia
Publication date: 14 December 2023
Published in: Journal of Algebra and Its Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2110.08158
polygon3-polytopeextension complexityslack matrixslack idealcomplex positive semidefinite (psd) minimalitysemidefinite lifts
Factorization of matrices (15A23) Exact enumeration problems, generating functions (05A15) Three-dimensional polytopes (52B10) Computational aspects related to convexity (52B55) Nonnumerical algorithms (68W05) Applications of commutative algebra (e.g., to statistics, control theory, optimization, etc.) (13P25)
Cites Work
- Unnamed Item
- Unnamed Item
- Common information and unique disjointness
- Polytopes of minimum positive semidefinite rank
- Self-dual spherical grids
- Four-dimensional polytopes of minimum positive semidefinite rank
- Some upper and lower bounds on PSD-rank
- On the finding of final polynomials
- Positive semidefinite rank
- Expressing combinatorial optimization problems by linear programs
- Enumeration of 2-level polytopes
- Projectively unique polytopes and toric slack ideals
- Which nonnegative matrices are slack matrices?
- Exponential Lower Bounds for Polytopes in Combinatorial Optimization
- On Vertices and Facets of Combinatorial 2-Level Polytopes
- Extension Complexity of Polytopes with Few Vertices or Facets
- Lower Bounds on the Size of Semidefinite Programming Relaxations
- On Ranks of Regular Polygons
- The Matching Polytope has Exponential Extension Complexity
- The Phaseless Rank of a Matrix
- Lifts of Convex Sets and Cone Factorizations
- An information complexity approach to extended formulations
