AbstractShellability of simplicial complexes has been a powerful concept in polyhedral theory, in p.l. topology and recently in connection with Cohen-Macaulay rings and toric varieties. It is well known that all 2-spheres and all boundary complexes of convex polytopes are shellable, but the analogous theorem fails for general simplicial balls and spheres. In this paper we study transformations of simplicial p.l. manifolds by elementary boundary operations (shellings and inverse shellings). As the main result we shall show that a simplicial p.l. manifold M can be transformed to any other simplical p.l. manifold M homeomorphic to M using these elementary operations. The tools we need and related results are summarized. In the last part we stu...
AbstractFor a property P of simplicial complexes, a simplicial complex Γ is an obstruction to P if Γ...
AbstractWe give new examples of shellable, but not extendably shellable two-dimensional simplicial c...
AbstractThere is currently no efficient algorithm for deciding whether a given simplicial complex is...
AbstractShellability of simplicial complexes has been a powerful concept in polyhydral theory, in p....
AbstractShellability of simplicial complexes has been a powerful concept in polyhedral theory, in p....
Shellability of simplicial complexes has been a useful concept in polyhedral theory, in piecewise li...
Chain complexes are studied here as an abstract algebraic generalisation of geometric simplicial com...
AbstractThe vertex stars of shellable polytopal complexes are shown to be shellable. The link of a v...
We prove that for every d ≥ 2, deciding if a pure, d-dimensional, simplicial complex is shellable is...
We prove that for every d >= 2, deciding if a pure, d-dimensional, simplicial complex is shellable i...
We say that a pure $d$-dimensional simplicial complex $\Delta$ on $n$ vertices is shelling completab...
A direct proof is given of the existence of non-shellable triangulations of spheres which, in higher...
A simplicial complex ∆ is shellable if its facets “fit nicely together”. Specifically, if there is a...
25 pages, 9 figuresWe introduce notions of tilings and shellings on finite simplicial complexes, ca...
We present a simple example of a regular CW complex which is not shellable (in a sense defined by Bj...
AbstractFor a property P of simplicial complexes, a simplicial complex Γ is an obstruction to P if Γ...
AbstractWe give new examples of shellable, but not extendably shellable two-dimensional simplicial c...
AbstractThere is currently no efficient algorithm for deciding whether a given simplicial complex is...
AbstractShellability of simplicial complexes has been a powerful concept in polyhydral theory, in p....
AbstractShellability of simplicial complexes has been a powerful concept in polyhedral theory, in p....
Shellability of simplicial complexes has been a useful concept in polyhedral theory, in piecewise li...
Chain complexes are studied here as an abstract algebraic generalisation of geometric simplicial com...
AbstractThe vertex stars of shellable polytopal complexes are shown to be shellable. The link of a v...
We prove that for every d ≥ 2, deciding if a pure, d-dimensional, simplicial complex is shellable is...
We prove that for every d >= 2, deciding if a pure, d-dimensional, simplicial complex is shellable i...
We say that a pure $d$-dimensional simplicial complex $\Delta$ on $n$ vertices is shelling completab...
A direct proof is given of the existence of non-shellable triangulations of spheres which, in higher...
A simplicial complex ∆ is shellable if its facets “fit nicely together”. Specifically, if there is a...
25 pages, 9 figuresWe introduce notions of tilings and shellings on finite simplicial complexes, ca...
We present a simple example of a regular CW complex which is not shellable (in a sense defined by Bj...
AbstractFor a property P of simplicial complexes, a simplicial complex Γ is an obstruction to P if Γ...
AbstractWe give new examples of shellable, but not extendably shellable two-dimensional simplicial c...
AbstractThere is currently no efficient algorithm for deciding whether a given simplicial complex is...