Constructible complexes and recursive division of posets

DOI10.1016/S0304-3975(99)00195-4MaRDI QIDQ1978709zbMATH OpenFDO

Authors Masahiro Hachimori

Publication date 4 June 2000

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0304-3975(99)00195-4

zbMATH Keywords

constructibleface posetpartitionableshellablesimplicial complex

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Review text

Shellability has been extensively studied by many researchers since McMullen solved the upper bound theorem for convex polytopes. There are also some important notions weaker than shellability, and in this paper we treat constructibility among these and define a notion of recursively dividable posets which corresponds to the notion of constructible complexes when seeing their face posets. Also, we define a notion of strongly constructible complexes and, correspondingly, strongly dividable posets by strengthening the conditions, and prove that strongly dividable posets are signable. This result means that strongly constructible simplicial complexes are partitionable.

Recommendations

• Strongly signable and partitionable posets
• Signable posets and partitionable simplicial complexes
• Oriented matroid polytopes and polyhedral fans are signable

Cites work

• Combinatorics and commutative algebra.
• scientific article; zbMATH DE number 53152 (Why is no real title available?)
• Lectures on Polytopes
• On Lexicographically Shellable Posets
• Posets, regular CW complexes and Bruhat order
• Shellable Decompositions of Cells and Spheres.
• Signable posets and partitionable simplicial complexes
• The maximum numbers of faces of a convex polytope
• The Upper Bound Conjecture and Cohen-Macaulay Rings
• Which Spheres are Shellable?

Cited in

(16)

• Overview of shelling for 2-manifold surface reconstruction based on 3D Delaunay triangulation
• Shellings from relative shellings, with an application to NP-completeness
• A combinatorial-topological shape category for polygraphs
• A balanced non-partitionable Cohen-Macaulay complex
• Cubical convex ear decompositions
• Contractible Hamiltonian cycles in triangulated surfaces
• A non-partitionable Cohen-Macaulay simplicial complex
• Catalan recursion on externally ordered bases of unit interval positroids
• Discrete Morse theory for manifolds with boundary
• A non-partitionable Cohen-Macaulay simplicial complex
• Minimal Cohen-Macaulay simplicial complexes
• Mogami manifolds, nuclei, and 3D simplicial gravity
• The Poset of Proper Divisibility
• Corners and simpliciality in oriented matroids and partial cubes
• Generalized recursive atom ordering and equivalence to CL-shellability
• Strong homotopy types, nerves and collapses

This page was built for publication: Constructible complexes and recursive division of posets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1978709)