Oriented matroid polytopes and polyhedral fans are signable

DOI10.1007/3-540-59408-6_52zbMath1505.05035OpenAlexW1526253596MaRDI QIDQ5101416

Peter Kleinschmidt, Shmuel Onn

Publication date: 30 August 2022

Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-59408-6_52

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items

Recognising a partitionable simplicial complex is in \(\text{NP}\), Colourful linear programming

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Convexity in oriented matroids
• Signable posets and partitionable simplicial complexes
• On Lexicographically Shellable Posets
• Decompositions of Simplicial Complexes Related to Diameters of Convex Polyhedra
• On the Geometry and Computational Complexity of Radon Partitions in the Iinteger Lattice
• THE PROBLEM OF DISCRIMINATING ALGORITHMICALLY THE STANDARD THREE-DIMENSIONAL SPHERE
• Which Spheres are Shellable?
• Lectures on Polytopes
• The maximum numbers of faces of a convex polytope