Lower bounds for the simplexity of the n-cube
Metric Geometry
2012-12-27 v2
Abstract
In this paper we prove a new asymptotic lower bound for the minimal number of simplices in simplicial dissections of -dimensional cubes. In particular we show that the number of simplices in dissections of -cubes without additional vertices is at least .
Cite
@article{arxiv.0910.4200,
title = {Lower bounds for the simplexity of the n-cube},
author = {Alexey Glazyrin},
journal= {arXiv preprint arXiv:0910.4200},
year = {2012}
}
Comments
10 pages