Signable posets and partitionable simplicial complexes

DOI10.1007/BF02711519zbMath0853.52010MaRDI QIDQ1913695

Shmuel Onn, Peter Kleinschmidt

Publication date: 27 May 1996

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

zbMATH Keywords

computational complexityshellableface enumerationmatroid polytope\(h\)-numberspartitionable simplicial complexsignable posets

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items

A Mihalisin-Klee theorem for fans, Oriented matroid polytopes and polyhedral fans are signable, A note on shellability and acyclic orientations, Unique sink orientations of grids, Constructible complexes and recursive division of posets, Colourful linear programming, Obstructions to shellability, partitionability, and sequential Cohen-Macaulayness, Unnamed Item, Sequential partitions of nonpure simplicial complexes, On the Holt-Klee property for oriented matroid programming

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Convexity in oriented matroids
• On Lexicographically Shellable Posets
• Hard Enumeration Problems in Geometry and Combinatorics
• Decompositions of Simplicial Complexes Related to Diameters of Convex Polyhedra
• THE PROBLEM OF DISCRIMINATING ALGORITHMICALLY THE STANDARD THREE-DIMENSIONAL SPHERE
• A Representation of 2-dimensional Pseudomanifolds and its use in the Design of a Linear-Time Shelling Algorithm
• Which Spheres are Shellable?
• The maximum numbers of faces of a convex polytope
• Combinatorics and commutative algebra
• Schälbare Cohen-Macaulay-Komplexe und ihre Parametrisierung. (Shellable Cohen-Macaulay complexes and their parametrization)