Positive Plücker tree certificates for non-realizability

DOI10.1080/10586458.2021.1994487arXiv2012.11500OpenAlexW4207058401MaRDI QIDQ6192598FDOQ6192598

Julian Pfeifle

Publication date: 11 March 2024

Published in: Experimental Mathematics (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/2012.11500

zbMATH Keywords

integer programmingrealizabilitysimplicial spherefinal polynomialPlücker relations

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Combinatorial aspects of simplicial complexes (05E45)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• polymake: a framework for analyzing convex polytopes
• Realization spaces of 4-polytopes are universal
• Combinatorial Commutative Algebra
• Upper bounds for configurations and polytopes in \({\mathbb{R}}^ d\)
• Many triangulated spheres
• Many triangulated odd-dimensional spheres
• The number of polytopes, configurations and real matroids
• Many neighborly polytopes and oriented matroids
• The Upper Bound Conjecture and Cohen-Macaulay Rings
• Many triangulated 3-spheres
• Neighborly polytopes
• A counterexample to the Hirsch conjecture
• Understanding and using linear programming
• Computation with Polynomial Equations and Inequalities Arising in Combinatorial Optimization
• An infinite family of nearly neighborly centrally symmetric 3-spheres
• Polytopality and Cartesian products of graphs
• The universality theorem for neighborly polytopes
• A generalized lower bound theorem for balanced manifolds
• Balanced generalized lower bound inequality for simplicial polytopes
• A Positivstellensatz for Sums of Nonnegative Circuit Polynomials
• The slack realization space of a matroid
• The Slack Realization Space of a Polytope
• Highly neighborly centrally symmetric spheres
• Ear decomposition and balanced neighborly simplicial manifolds
• Balanced triangulations on few vertices and an implementation of cross-flips

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)