DOIAbstract
AbstractIt is known that the 4-dimensional cube can be triangulated by a set of 16 simplices. This note demonstrates that the 4-dimensional cube cannot be triangulated with fewer than 16 simplices
AbstractIt is known that the 4-dimensional cube can be triangulated by a set of 16 simplices. This note demonstrates that the 4-dimensional cube cannot be triangulated with fewer than 16 simplices
AbstractLet cd be the d-dimensional cube. A cut of cd is a set of all edges that are intersected by ...
AbstractWe show that the minimum number of simplices in a triangulation of the 5-cube is 67, and tha...
AbstractWe show that any triangulation of the 5-cube I5 by complete truncation, i.e., ‘slicing off’ ...
AbstractIt is known that the 4-dimensional cube can be triangulated by a set of 16 simplices. This n...
AbstractThis paper is concerned with estimating ϕ(n), the minimum number of n-simplices required to ...
AbstractWe give a triangulation of the 6-cube into 308 simplices; this is the smallest number in any...
AbstractWe show that the minimum number of simplices in a triangulation of the 5-cube is 67, and tha...
In this note we consider the problem of determining a minimal triangula-tion of I”, the n-dimensiona...
summary:Cottle's proof that the minimal number of $0/1$-simplices needed to triangulate the unit $4...
summary:Cottle's proof that the minimal number of $0/1$-simplices needed to triangulate the unit $4...
Cottle's proof that the minimal number of 0=1-simplices needed to triangulate the unit 4-cube equals...
AbstractThis paper is concerned with finding a lower bound for ϕ(n), the minimum number of simplices...
Abstract. Considering the hypothesis that there exists a polyhedron with a minimal triangulation by ...
AbstractWe give a triangulation of the 6-cube into 308 simplices; this is the smallest number in any...
AbstractIn this paper we prove a new asymptotic lower bound for the minimal number of simplices in s...
AbstractLet cd be the d-dimensional cube. A cut of cd is a set of all edges that are intersected by ...
AbstractWe show that the minimum number of simplices in a triangulation of the 5-cube is 67, and tha...
AbstractWe show that any triangulation of the 5-cube I5 by complete truncation, i.e., ‘slicing off’ ...
AbstractIt is known that the 4-dimensional cube can be triangulated by a set of 16 simplices. This n...
AbstractThis paper is concerned with estimating ϕ(n), the minimum number of n-simplices required to ...
AbstractWe give a triangulation of the 6-cube into 308 simplices; this is the smallest number in any...
AbstractWe show that the minimum number of simplices in a triangulation of the 5-cube is 67, and tha...
In this note we consider the problem of determining a minimal triangula-tion of I”, the n-dimensiona...
summary:Cottle's proof that the minimal number of $0/1$-simplices needed to triangulate the unit $4...
summary:Cottle's proof that the minimal number of $0/1$-simplices needed to triangulate the unit $4...
Cottle's proof that the minimal number of 0=1-simplices needed to triangulate the unit 4-cube equals...
AbstractThis paper is concerned with finding a lower bound for ϕ(n), the minimum number of simplices...
Abstract. Considering the hypothesis that there exists a polyhedron with a minimal triangulation by ...
AbstractWe give a triangulation of the 6-cube into 308 simplices; this is the smallest number in any...
AbstractIn this paper we prove a new asymptotic lower bound for the minimal number of simplices in s...
AbstractLet cd be the d-dimensional cube. A cut of cd is a set of all edges that are intersected by ...
AbstractWe show that the minimum number of simplices in a triangulation of the 5-cube is 67, and tha...
AbstractWe show that any triangulation of the 5-cube I5 by complete truncation, i.e., ‘slicing off’ ...
Add to ORKG