AbstractIn this paper we prove a new asymptotic lower bound for the minimal number of simplices in simplicial dissections of n-dimensional cubes. In particular we show that the number of simplices in dissections of n-cubes without additional vertices is at least (n+1)n−12
AbstractIt is known that the 4-dimensional cube can be triangulated by a set of 16 simplices. This n...
International audiencethis is an extended abstract of the full version. We study n-vertex d-dimensio...
AbstractWe show that the minimum number of simplices in a triangulation of the 5-cube is 67, and tha...
AbstractIn this paper we prove a new asymptotic lower bound for the minimal number of simplices in s...
AbstractThis paper is concerned with finding a lower bound for ϕ(n), the minimum number of simplices...
We show that the size of a minimal simplicial cover of a polytope P is a lower bound for the size of...
AbstractThis paper is concerned with estimating ϕ(n), the minimum number of n-simplices required to ...
AbstractWe show that the minimum number of simplices in a triangulation of the 5-cube is 67, and tha...
AbstractThis paper is concerned with finding a lower bound for ϕ(n), the minimum number of simplices...
AbstractWe give a triangulation of the 6-cube into 308 simplices; this is the smallest number in any...
AbstractLet T(n) denote the number of n -simplices in a minimum cardinality decomposition of the n -...
A dissection of a convex d-polytope is a partition of the polytope into d-simplices whose vertices a...
How many triangles does it take to make a square? The answer is simple: two. This problem has a dire...
How many triangles does it take to make a square? The answer is simple: two. This problem has a dire...
AbstractLet T(n) denote the number of n -simplices in a minimum cardinality decomposition of the n -...
AbstractIt is known that the 4-dimensional cube can be triangulated by a set of 16 simplices. This n...
International audiencethis is an extended abstract of the full version. We study n-vertex d-dimensio...
AbstractWe show that the minimum number of simplices in a triangulation of the 5-cube is 67, and tha...
AbstractIn this paper we prove a new asymptotic lower bound for the minimal number of simplices in s...
AbstractThis paper is concerned with finding a lower bound for ϕ(n), the minimum number of simplices...
We show that the size of a minimal simplicial cover of a polytope P is a lower bound for the size of...
AbstractThis paper is concerned with estimating ϕ(n), the minimum number of n-simplices required to ...
AbstractWe show that the minimum number of simplices in a triangulation of the 5-cube is 67, and tha...
AbstractThis paper is concerned with finding a lower bound for ϕ(n), the minimum number of simplices...
AbstractWe give a triangulation of the 6-cube into 308 simplices; this is the smallest number in any...
AbstractLet T(n) denote the number of n -simplices in a minimum cardinality decomposition of the n -...
A dissection of a convex d-polytope is a partition of the polytope into d-simplices whose vertices a...
How many triangles does it take to make a square? The answer is simple: two. This problem has a dire...
How many triangles does it take to make a square? The answer is simple: two. This problem has a dire...
AbstractLet T(n) denote the number of n -simplices in a minimum cardinality decomposition of the n -...
AbstractIt is known that the 4-dimensional cube can be triangulated by a set of 16 simplices. This n...
International audiencethis is an extended abstract of the full version. We study n-vertex d-dimensio...
AbstractWe show that the minimum number of simplices in a triangulation of the 5-cube is 67, and tha...
DOI
Add to ORKG