Add to ORKGsummary:Cottle's proof that the minimal number of $0/1$-simplices needed to triangulate the unit $4$-cube equals $16$ uses a modest amount of computer generated results. In this paper we remove the need for computer aid, using some lemmas that may be useful also in a broader context. One of the $0/1$-simplices involved, the so-called antipodal simplex, has acute dihedral angles. We continue with the study of such acute binary simplices and point out their possible relation to the Hadamard determinant problem
In this note we consider the problem of determining a minimal triangula-tion of I”, the n-dimensiona...
AbstractWe give a triangulation of the 6-cube into 308 simplices; this is the smallest number in any...
The convex hull of n + 1 affinely independent vertices of the unit n-cube In is called a 0/1-simplex...
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...
This thesis focuses on the study of certain special classes of n-simplices that occur in the context...
AbstractIt is known that the 4-dimensional cube can be triangulated by a set of 16 simplices. This n...
AbstractWe show that the minimum number of simplices in a triangulation of the 5-cube is 67, and tha...
It is shown that there exists a dihedral acute triangulation of the three-dimensional cube. The meth...
AbstractIt is shown that there exists a dihedral acute triangulation of the three-dimensional cube. ...
It is shown that there exists a dihedral acute triangulation of the three-dimensional cube. The meth...
We study the problem of acute triangulations of convex polyhedra and the space Rn. Here an acute tri...
AbstractIt is shown that there exists a dihedral acute triangulation of the three-dimensional cube. ...
We study the problem of acute triangulations of convex polyhedra and the space Rn. Here an acute tri...
AbstractIn this paper we prove a new asymptotic lower bound for the minimal number of simplices in s...
In this note we consider the problem of determining a minimal triangula-tion of I”, the n-dimensiona...
AbstractWe give a triangulation of the 6-cube into 308 simplices; this is the smallest number in any...
The convex hull of n + 1 affinely independent vertices of the unit n-cube In is called a 0/1-simplex...
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...
This thesis focuses on the study of certain special classes of n-simplices that occur in the context...
AbstractIt is known that the 4-dimensional cube can be triangulated by a set of 16 simplices. This n...
AbstractWe show that the minimum number of simplices in a triangulation of the 5-cube is 67, and tha...
It is shown that there exists a dihedral acute triangulation of the three-dimensional cube. The meth...
AbstractIt is shown that there exists a dihedral acute triangulation of the three-dimensional cube. ...
It is shown that there exists a dihedral acute triangulation of the three-dimensional cube. The meth...
We study the problem of acute triangulations of convex polyhedra and the space Rn. Here an acute tri...
AbstractIt is shown that there exists a dihedral acute triangulation of the three-dimensional cube. ...
We study the problem of acute triangulations of convex polyhedra and the space Rn. Here an acute tri...
AbstractIn this paper we prove a new asymptotic lower bound for the minimal number of simplices in s...
In this note we consider the problem of determining a minimal triangula-tion of I”, the n-dimensiona...
AbstractWe give a triangulation of the 6-cube into 308 simplices; this is the smallest number in any...
The convex hull of n + 1 affinely independent vertices of the unit n-cube In is called a 0/1-simplex...