Let M be an n-vertex combinatorial triangulation of a $Z_{2}$-homology d-sphere. In this paper we prove that if n \leq d + 8 then M must be a combinatorial sphere. Further, if n = d + 9 and M is not a combinatorial sphere then M cannot admit any proper bistellar move. Existence of a 12-vertex triangulation of the lens space L(3, 1) shows that the first result is sharp in dimension three. In the course of the proof we also show that any $Z_{2}$-acyclic sitnplicial complex on \leq 7 vertices is necessarily collapsible. This result is best possible since there exist 8-vertex triangulations of the Dunce Hat which are not collapsible
AbstractThe different combinatorial types of triangulations of the 3-sphere with up to 8 vertices ar...
AbstractThe different combinatorial types of triangulations of the 3-sphere with up to 8 vertices ar...
International audienceThis paper considers compact triangulated polyhedra of genus zero. Let V n = {...
Let M be an n-vertex combinatorial triangulation of a $Z_{2}$-homology d-sphere. In this paper we pr...
AbstractLet M be an n-vertex combinatorial triangulation of a Z2-homology d-sphere. In this paper we...
Let Mu be an n-vertex combinatorial triangulation of a Ζ2-homology d-sphere. In this paper we p...
ABSTRACT. Necessary and sufficient conditions are given for the sim-plicial triangulation of all non...
In combinatorial topology we aim to triangulate manifolds such that their topological properties are...
We analyze an algorithm for computing the homology type of a triangulation. By triangulation, we me...
We prove that all combinatorial differential manifolds involving only Euclidean oriented matroids ar...
There are essentially two ways to decompose a (compact, connected) d-mani-fold (without boundary) in...
A simplicial d-complex is foldable if it is (d+1)-colorable in the graph theoretic sense. Such a col...
A simplicial d-complex is foldable if it is (d+1)-colorable in the graph theoretic sense. Such a col...
A centrally symmetric $2d$-vertex combinatorial triangulation of the product of spheres $\S...
A centrally symmetric $2d$-vertex combinatorial triangulation of the product of spheres $\S...
AbstractThe different combinatorial types of triangulations of the 3-sphere with up to 8 vertices ar...
AbstractThe different combinatorial types of triangulations of the 3-sphere with up to 8 vertices ar...
International audienceThis paper considers compact triangulated polyhedra of genus zero. Let V n = {...
Let M be an n-vertex combinatorial triangulation of a $Z_{2}$-homology d-sphere. In this paper we pr...
AbstractLet M be an n-vertex combinatorial triangulation of a Z2-homology d-sphere. In this paper we...
Let Mu be an n-vertex combinatorial triangulation of a Ζ2-homology d-sphere. In this paper we p...
ABSTRACT. Necessary and sufficient conditions are given for the sim-plicial triangulation of all non...
In combinatorial topology we aim to triangulate manifolds such that their topological properties are...
We analyze an algorithm for computing the homology type of a triangulation. By triangulation, we me...
We prove that all combinatorial differential manifolds involving only Euclidean oriented matroids ar...
There are essentially two ways to decompose a (compact, connected) d-mani-fold (without boundary) in...
A simplicial d-complex is foldable if it is (d+1)-colorable in the graph theoretic sense. Such a col...
A simplicial d-complex is foldable if it is (d+1)-colorable in the graph theoretic sense. Such a col...
A centrally symmetric $2d$-vertex combinatorial triangulation of the product of spheres $\S...
A centrally symmetric $2d$-vertex combinatorial triangulation of the product of spheres $\S...
AbstractThe different combinatorial types of triangulations of the 3-sphere with up to 8 vertices ar...
AbstractThe different combinatorial types of triangulations of the 3-sphere with up to 8 vertices ar...
International audienceThis paper considers compact triangulated polyhedra of genus zero. Let V n = {...