Positive Plücker tree certificates for non-realizability
From MaRDI portal
Publication:6192598
Abstract: We introduce a new method for finding a non-realizability certificate of a simplicial sphere Sigma: we exhibit a monomial combination of classical 3-term Pl"ucker relations that yields a sum of products of determinants that are known to be positive in any realization of Sigma; but their sum should vanish, contradiction. Using this technique, we prove for the first time the non-realizability of a balanced 2-neighborly 3-sphere constructed by Zheng, a family of highly neighborly centrally symmetric spheres constructed by by Novik and Zheng, and several combinatorial prismatoids introduced by Criado and Santos. The method in fact works for orientable pseudo-manifolds, not just for spheres.
Recommendations
- Large final polynomials from integer programming
- General non-realizability certificates for spheres with linear programming
- Realizability and inscribability for simplicial polytopes via nonlinear optimization
- Small Examples of Nonconstructible Simplicial Balls and Spheres
- Deciding non-realizability of oriented matroids by semidefinite programming
Cites work
- scientific article; zbMATH DE number 4092241 (Why is no real title available?)
- scientific article; zbMATH DE number 4102053 (Why is no real title available?)
- scientific article; zbMATH DE number 17663 (Why is no real title available?)
- scientific article; zbMATH DE number 1234104 (Why is no real title available?)
- scientific article; zbMATH DE number 1142316 (Why is no real title available?)
- scientific article; zbMATH DE number 1827070 (Why is no real title available?)
- scientific article; zbMATH DE number 6437647 (Why is no real title available?)
- scientific article; zbMATH DE number 3299786 (Why is no real title available?)
- A Positivstellensatz for sums of nonnegative circuit polynomials
- A counterexample to the Hirsch conjecture
- A generalized lower bound theorem for balanced manifolds
- An infinite family of nearly neighborly centrally symmetric 3-spheres
- Balanced generalized lower bound inequality for simplicial polytopes
- Balanced triangulations on few vertices and an implementation of cross-flips
- Combinatorial Commutative Algebra
- Computation with polynomial equations and inequalities arising in combinatorial optimization
- Ear decomposition and balanced neighborly simplicial manifolds
- Highly neighborly centrally symmetric spheres
- Many neighborly polytopes and oriented matroids
- Many triangulated 3-spheres
- Many triangulated odd-dimensional spheres
- Many triangulated spheres
- Neighborly polytopes
- Polytopality and Cartesian products of graphs
- Realization spaces of 4-polytopes are universal
- The Upper Bound Conjecture and Cohen-Macaulay Rings
- The number of polytopes, configurations and real matroids
- The slack realization space of a matroid
- The slack realization space of a polytope
- The universality theorem for neighborly polytopes
- Understanding and using linear programming
- Upper bounds for configurations and polytopes in \({\mathbb{R}}^ d\)
- polymake: a framework for analyzing convex polytopes
This page was built for publication: Positive Plücker tree certificates for non-realizability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6192598)