Add to ORKGWe give a complete enumeration of combinatorial 3-manifolds with 10 vertices: There are precisely 247882 triangulated 3-spheres with 10 vertices as well as 518 vertex-minimal triangulations of the sphere product S2×S1 and 615 triangulations of the twisted sphere product S2×S1. All the 3-spheres with up to 10 vertices are shellable, but there are 29 vertex-minimal non-shellable 3-balls with 9 vertices
AbstractWE SHOW that a d-manifold M with less than 3⌈d2⌉+3 vertices is a sphere and that a d-manifol...
In this paper, we treat the decision problem of constructibility. This problem was solved only under...
A census is presented of all closed non-orientable 3-manifold triangulations formed from at most sev...
AbstractA complete classification is given for non-neighborly combinatorial 3-manifolds with nine ve...
AbstractIt is proved that every combinatorial 3-manifold with at most eight vertices is a combinator...
AbstractA complete classification is given for neighborly combinatorial 3-manifolds with 9 vertices....
The understanding and classication of (compact) 3-dimensional manifolds (without boundary) is with n...
The understanding and classification of (compact) 3-dimensional manifolds (without boundary) is with...
Via a computer search, Altshuler and Steinberg found that there are 1296+1 combinatorial 3-manifolds...
Via a computer search, Altshuler and Steinberg found that there are 1296+1 combinatorial 3-manifolds...
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 ...
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...
Via a computer search, Altshuler and Steinberg found that there are 1296+1 combinatorial 3-manifolds...
AbstractWE SHOW that a d-manifold M with less than 3⌈d2⌉+3 vertices is a sphere and that a d-manifol...
In this paper, we treat the decision problem of constructibility. This problem was solved only under...
A census is presented of all closed non-orientable 3-manifold triangulations formed from at most sev...
AbstractA complete classification is given for non-neighborly combinatorial 3-manifolds with nine ve...
AbstractIt is proved that every combinatorial 3-manifold with at most eight vertices is a combinator...
AbstractA complete classification is given for neighborly combinatorial 3-manifolds with 9 vertices....
The understanding and classication of (compact) 3-dimensional manifolds (without boundary) is with n...
The understanding and classification of (compact) 3-dimensional manifolds (without boundary) is with...
Via a computer search, Altshuler and Steinberg found that there are 1296+1 combinatorial 3-manifolds...
Via a computer search, Altshuler and Steinberg found that there are 1296+1 combinatorial 3-manifolds...
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 ...
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...
Via a computer search, Altshuler and Steinberg found that there are 1296+1 combinatorial 3-manifolds...
AbstractWE SHOW that a d-manifold M with less than 3⌈d2⌉+3 vertices is a sphere and that a d-manifol...
In this paper, we treat the decision problem of constructibility. This problem was solved only under...
A census is presented of all closed non-orientable 3-manifold triangulations formed from at most sev...