AbstractA triangulated 3-sphere is said to be polyhedral provided it is isomorphic to the boundary of some convex 4-dimensional polytope. We show that a certain complex of six triangles when embedded in a 3-sphere in a certain way will prevent polyhedrality of the sphere. We also show that spheres with this subcomplex are not invertible, and that this complex together with an additional triangle prevents the existence of a dual diagram
Let Mu be an n-vertex combinatorial triangulation of a Ζ2-homology d-sphere. In this paper we p...
Triangulations of 3-dimensional polyhedron are partitions of the polyhedron with tetrahedra in a fac...
AbstractIt is a consequence of a theorem of Steinitz that the boundary of every convex 3-dimensional...
AbstractA triangulated 3-sphere is said to be polyhedral provided it is isomorphic to the boundary o...
AbstractThe different combinatorial types of triangulations of the 3-sphere with up to 8 vertices ar...
AbstractWe present a 3-diagram D with 8 vertices, which is not isomorphic to a Schiegel-diagram of a...
AbstractAs shown by D. Barnette (1973, J. Combin. Theory Ser. A14, 37–53) there are precisely 39 sim...
AbstractThe classification of the 1296 (simplicial) 3-spheres with nine vertices into polytopal and ...
AbstractAn algorithm to enumerate the combinatorial types of three-spheres is described. The respect...
AbstractThe different combinatorial types of triangulations of the 3-sphere with up to 8 vertices ar...
AbstractWe show that neither the 3-ball nor the solid torus admits a triangulation in which (i) ever...
AbstractA 3 × 3 block of squares, with opposite sides identified in the usual way, yields a “map” of...
AbstractAs shown by D. Barnette (1973, J. Combin. Theory Ser. A14, 37–53) there are precisely 39 sim...
AbstractWe present a 3-diagram D with 8 vertices, which is not isomorphic to a Schiegel-diagram of a...
When does a topological polyhedral complex (embedded in Rd) admit a geometric realization (a rectili...
Let Mu be an n-vertex combinatorial triangulation of a Ζ2-homology d-sphere. In this paper we p...
Triangulations of 3-dimensional polyhedron are partitions of the polyhedron with tetrahedra in a fac...
AbstractIt is a consequence of a theorem of Steinitz that the boundary of every convex 3-dimensional...
AbstractA triangulated 3-sphere is said to be polyhedral provided it is isomorphic to the boundary o...
AbstractThe different combinatorial types of triangulations of the 3-sphere with up to 8 vertices ar...
AbstractWe present a 3-diagram D with 8 vertices, which is not isomorphic to a Schiegel-diagram of a...
AbstractAs shown by D. Barnette (1973, J. Combin. Theory Ser. A14, 37–53) there are precisely 39 sim...
AbstractThe classification of the 1296 (simplicial) 3-spheres with nine vertices into polytopal and ...
AbstractAn algorithm to enumerate the combinatorial types of three-spheres is described. The respect...
AbstractThe different combinatorial types of triangulations of the 3-sphere with up to 8 vertices ar...
AbstractWe show that neither the 3-ball nor the solid torus admits a triangulation in which (i) ever...
AbstractA 3 × 3 block of squares, with opposite sides identified in the usual way, yields a “map” of...
AbstractAs shown by D. Barnette (1973, J. Combin. Theory Ser. A14, 37–53) there are precisely 39 sim...
AbstractWe present a 3-diagram D with 8 vertices, which is not isomorphic to a Schiegel-diagram of a...
When does a topological polyhedral complex (embedded in Rd) admit a geometric realization (a rectili...
Let Mu be an n-vertex combinatorial triangulation of a Ζ2-homology d-sphere. In this paper we p...
Triangulations of 3-dimensional polyhedron are partitions of the polyhedron with tetrahedra in a fac...
AbstractIt is a consequence of a theorem of Steinitz that the boundary of every convex 3-dimensional...