Large final polynomials from integer programming

Abstract

We introduce a new method for finding a non-realizability certificate of a simplicial sphere Σ. It enables us to prove for the first time the non-realizability of a balanced 2-neighborly 3-sphere by Zheng, a family of highly neighborly centrally symmetric spheres by Novik and Zheng, and several combinatorial prismatoids introduced by Criado and Santos. The method, implemented in the polymake framework, uses integer programming to find a monomial combination of classical 3-term Plücker relations that must be positive in any realization of Σ; but since this combination should also vanish identically, the realization cannot exist. Previous approaches by Firsching, implemented using SCIP, and by Gouveia, Macchia and Wiebe, implemented using Singular and Macaulay2, are not able to process these examples.