2026-04-17T00:40:26Zhttps://recercat.cat/oai/request

oai:recercat.cat:2117/3629552026-02-02T08:20:14Zcom_2072_1033col_2072_452950

Large final polynomials from integer programming Pfeifle, Julián Universitat Politècnica de Catalunya. Departament de Matemàtiques Universitat Politècnica de Catalunya. GAPCOMB - Geometric, Algebraic and Probabilistic Combinatorics Àrees temàtiques de la UPC::Matemàtiques i estadística::Investigació operativa::Programació matemàtica Integer programming Programació en nombres enters Classificació AMS::90 Operations research, mathematical programming::90C Mathematical programming Classificació AMS::52 Convex and discrete geometry::52B Polytopes and polyhedra We introduce a new method for finding a non-realizability certificate of a simplicial sphere S. 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 S; 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. Peer Reviewed Postprint (author's final draft) 2021-09 Article Pfeifle, J. Large final polynomials from integer programming. "ACM COMMUNICATIONS IN COMPUTER ALGEBRA", Setembre 2021, vol. 55, núm. 3, p. 82-86. 1932-2240 https://hdl.handle.net/2117/362955 10.1145/3511528.3511533 eng https://dl.acm.org/doi/10.1145/3511528.3511533 Open Access 5 p. application/pdf