Let Mu be an n-vertex combinatorial triangulation of a Ζ2-homology d-sphere. In this paper we prove that if n ≤ d+8 then Mu must be a combinatorial sphere. Further, if n=d+9 and M is not a combinatorial sphere then Mu 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Ζ2-acyclic simplicial complex on ≤7 vertices is necessarily collapsible. This result is best possible since there exist 8-vertex triangulations of the Dunce Hat which are not collapsible
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 simplicial d-complex is foldable if it is (d+1)-colorable in the graph theoretic sense. Such a col...
AbstractLet M be an n-vertex combinatorial triangulation of a Z2-homology d-sphere. In this paper we...
Let M be an n-vertex combinatorial triangulation of a $Z_{2}$-homology d-sphere. In this paper we pr...
Let M be an n-vertex combinatorial triangulation of a $Z_{2}$-homology d-sphere. In this paper we pr...
AbstractThe different combinatorial types of triangulations of the 3-sphere with up to 8 vertices ar...
A direct proof is given of the existence of non-shellable triangulations of spheres which, in higher...
Via a computer search, Altshuler and Steinberg found that there are 1296+1 combinatorial 3-manifolds...
There are essentially two ways to decompose a (compact, connected) d-mani-fold (without boundary) in...
AbstractVia a computer search, Altshuler and Steinberg found that there are 1296+1 combinatorial 3-m...
AbstractThe classification of the 1296 (simplicial) 3-spheres with nine vertices into polytopal and ...
ABSTRACT. Necessary and sufficient conditions are given for the sim-plicial triangulation of all non...
AbstractAn n-dimensional (convex) polytope is said to have few vertices if their number does not exc...
AbstractThe quantum physicists Durhuus and Jonsson (1995) [9] introduced the class of “locally const...
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 simplicial d-complex is foldable if it is (d+1)-colorable in the graph theoretic sense. Such a col...
AbstractLet M be an n-vertex combinatorial triangulation of a Z2-homology d-sphere. In this paper we...
Let M be an n-vertex combinatorial triangulation of a $Z_{2}$-homology d-sphere. In this paper we pr...
Let M be an n-vertex combinatorial triangulation of a $Z_{2}$-homology d-sphere. In this paper we pr...
AbstractThe different combinatorial types of triangulations of the 3-sphere with up to 8 vertices ar...
A direct proof is given of the existence of non-shellable triangulations of spheres which, in higher...
Via a computer search, Altshuler and Steinberg found that there are 1296+1 combinatorial 3-manifolds...
There are essentially two ways to decompose a (compact, connected) d-mani-fold (without boundary) in...
AbstractVia a computer search, Altshuler and Steinberg found that there are 1296+1 combinatorial 3-m...
AbstractThe classification of the 1296 (simplicial) 3-spheres with nine vertices into polytopal and ...
ABSTRACT. Necessary and sufficient conditions are given for the sim-plicial triangulation of all non...
AbstractAn n-dimensional (convex) polytope is said to have few vertices if their number does not exc...
AbstractThe quantum physicists Durhuus and Jonsson (1995) [9] introduced the class of “locally const...
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 simplicial d-complex is foldable if it is (d+1)-colorable in the graph theoretic sense. Such a col...