Lower bounds for the simplexity of the n-cube
Abstract
In 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-1 2.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.