A note on minimal triangulations of an n-cube

Abstract

This paper is concerned with finding a lower bound for ϕ( n), the minimum number of simplices required to triangulate an n-cube. We prove that ϕ( n)≥ L n , where L n is the minimum value of the sum of n−1 unknowns subject to n−1 inequality constraints. In particular, it is shown that ϕ(5)≥60.