In 1980 Provan and Billera defined the notion of weak $k$-decomposability for pure simplicial complexes. They showed the diameter of a weakly $k$-decomposable simplicial complex $\Delta$ is bounded above by a polynomial function of the number of $k$-faces in $\Delta$ and its dimension. For weakly 0-decomposable complexes, this bound is linear in the number of vertices and the dimension. In this paper we exhibit the first examples of non-weakly 0-decomposable simplicial polytopes
We study -vertex -dimensional polytopes with at most one nonsimplex facet with, say, vertices, calle...
International audienceWe say that a simplicial complex is shrinkable if there exists a sequence of a...
We apply combinatorial methods to a geometric problem: the classification of polytopes, in terms of ...
Provan and Billera introduced notions of (weak) decomposability of simplicial complexes as ...
Provan and Billera introduced notions of (weak) decomposability of simplicial complexes as ...
International audienceProvan and Billera introduced notions of (weak) decomposability of simplicial ...
Provan and Billera introduced notions of (weak) decomposability of simplicial complexes as a means o...
International audienceProvan and Billera introduced notions of (weak) decomposability of simplicial ...
In this paper we study the Alexander dual of a vertex decomposable simplicial complex. We define the...
AbstractWe give new examples of shellable, but not extendably shellable two-dimensional simplicial c...
This is an extended abstract of the full version. We study n-vertex d-dimensional polytopes with at ...
We investigate families of two-dimensional simplicial complexes defined in terms of vertex decomposi...
We apply combinatorial methods to a geometric problem: the classification of polytopes, in terms of ...
We introduce the theory of strong homotopy types of simplicial complexes. Similarly to classical sim...
A simplicial complex ∆ is shellable if its facets “fit nicely together”. Specifically, if there is a...
We study -vertex -dimensional polytopes with at most one nonsimplex facet with, say, vertices, calle...
International audienceWe say that a simplicial complex is shrinkable if there exists a sequence of a...
We apply combinatorial methods to a geometric problem: the classification of polytopes, in terms of ...
Provan and Billera introduced notions of (weak) decomposability of simplicial complexes as ...
Provan and Billera introduced notions of (weak) decomposability of simplicial complexes as ...
International audienceProvan and Billera introduced notions of (weak) decomposability of simplicial ...
Provan and Billera introduced notions of (weak) decomposability of simplicial complexes as a means o...
International audienceProvan and Billera introduced notions of (weak) decomposability of simplicial ...
In this paper we study the Alexander dual of a vertex decomposable simplicial complex. We define the...
AbstractWe give new examples of shellable, but not extendably shellable two-dimensional simplicial c...
This is an extended abstract of the full version. We study n-vertex d-dimensional polytopes with at ...
We investigate families of two-dimensional simplicial complexes defined in terms of vertex decomposi...
We apply combinatorial methods to a geometric problem: the classification of polytopes, in terms of ...
We introduce the theory of strong homotopy types of simplicial complexes. Similarly to classical sim...
A simplicial complex ∆ is shellable if its facets “fit nicely together”. Specifically, if there is a...
We study -vertex -dimensional polytopes with at most one nonsimplex facet with, say, vertices, calle...
International audienceWe say that a simplicial complex is shrinkable if there exists a sequence of a...
We apply combinatorial methods to a geometric problem: the classification of polytopes, in terms of ...