AbstractShellability of simplicial complexes has been a powerful concept in polyhydral theory, in p.l. topology and recently in connection with Cohen-Macaulay rings. It is known that all 2-spheres and all boundary complexes of convex polytopes are shellable. 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) and bistellar operations (the inner equivalent to shellings). It is shown that a simplicial p.l. manifold M can be transformed in any other simplicial p.l. manifold M' homeomorphic to M using these elementary operations. In the case of balls only elementary boundary operations are need...
A simplicial complex ∆ is shellable if its facets “fit nicely together”. Specifically, if there is a...
AbstractThere is currently no efficient algorithm for deciding whether a given simplicial complex is...
AbstractIn this paper, we treat the problem to find an efficient algorithm to decide constructibilit...
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...
We prove that for every d ≥ 2, deciding if a pure, d-dimensional, simplicial complex is shellable is...
AbstractThe vertex stars of shellable polytopal complexes are shown to be shellable. The link of a v...
A direct proof is given of the existence of non-shellable triangulations of spheres which, in higher...
Chain complexes are studied here as an abstract algebraic generalisation of geometric simplicial com...
We prove that for every d >= 2, deciding if a pure, d-dimensional, simplicial complex is shellable i...
AbstractIn 1992, Thomas Bier introduced a surprisingly simple way to construct a large number of sim...
We say that a pure $d$-dimensional simplicial complex $\Delta$ on $n$ vertices is shelling completab...
25 pages, 9 figuresWe introduce notions of tilings and shellings on finite simplicial complexes, ca...
AbstractWe give new examples of shellable, but not extendably shellable two-dimensional simplicial c...
In this paper, we treat the decision problem of constructibility. This problem was solved only under...
A simplicial complex ∆ is shellable if its facets “fit nicely together”. Specifically, if there is a...
AbstractThere is currently no efficient algorithm for deciding whether a given simplicial complex is...
AbstractIn this paper, we treat the problem to find an efficient algorithm to decide constructibilit...
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...
We prove that for every d ≥ 2, deciding if a pure, d-dimensional, simplicial complex is shellable is...
AbstractThe vertex stars of shellable polytopal complexes are shown to be shellable. The link of a v...
A direct proof is given of the existence of non-shellable triangulations of spheres which, in higher...
Chain complexes are studied here as an abstract algebraic generalisation of geometric simplicial com...
We prove that for every d >= 2, deciding if a pure, d-dimensional, simplicial complex is shellable i...
AbstractIn 1992, Thomas Bier introduced a surprisingly simple way to construct a large number of sim...
We say that a pure $d$-dimensional simplicial complex $\Delta$ on $n$ vertices is shelling completab...
25 pages, 9 figuresWe introduce notions of tilings and shellings on finite simplicial complexes, ca...
AbstractWe give new examples of shellable, but not extendably shellable two-dimensional simplicial c...
In this paper, we treat the decision problem of constructibility. This problem was solved only under...
A simplicial complex ∆ is shellable if its facets “fit nicely together”. Specifically, if there is a...
AbstractThere is currently no efficient algorithm for deciding whether a given simplicial complex is...
AbstractIn this paper, we treat the problem to find an efficient algorithm to decide constructibilit...