General non-realizability certificates for spheres with linear programming
From MaRDI portal
Publication:2156365
DOI10.1016/j.jsc.2022.04.013zbMath1493.05061arXiv2109.15247OpenAlexW3203615057WikidataQ114154440 ScholiaQ114154440MaRDI QIDQ2156365
Amy Wiebe, Antonio Macchia, João Gouveia
Publication date: 18 July 2022
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2109.15247
linear programmingslack matricesfinal polynomialsnon-realizability certificatesnon-realizable combinatorial polytopes
Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Linear programming (90C05) Combinatorial aspects of matroids and geometric lattices (05B35)
Related Items
Uses Software
Cites Work
- Unnamed Item
- The complete enumeration of 4-polytopes and 3-spheres with nine vertices
- On the finding of final polynomials
- Every non-Euclidean oriented matroid admits a biquadratic final polynomial
- Nonrealizability proofs in computational geometry
- Neighborly cubical polytopes and spheres
- Computational synthetic geometry
- Euclideaness and final polynomials in oriented matroid theory
- Highly neighborly centrally symmetric spheres
- Ear decomposition and balanced neighborly simplicial manifolds
- Projectively unique polytopes and toric slack ideals
- Which nonnegative matrices are slack matrices?
- Enumerating Neighborly Polytopes and Oriented Matroids
- Positive polynomials and product type actions of compact groups
- On the real spectrum of a ring and its application to semialgebraic geometry
- Neighborly 4-Polytopes and Neighborly Combinatorial 3-Manifolds with Ten Vertices
- Slack Ideals in Macaulay2
- The Slack Realization Space of a Polytope
- When does a polynomial ideal contain a positive polynomial?
