Lower bounds for the simplexity of the n-cube

Details Lower bounds for the simplexity of the n-cube Lower bounds for the simplexity of the n-cube

2009-10-21

arxiv.org/abs/0910.4200v1

Mathematics

Metric Geometry

8 pages

Scientific paper

In this paper we prove the new asymptotic lower bound for the minimal number
of simplices in simplicial dissections of $n$-dimensional cubes.

Affiliated with

Also associated with

No associations

Rating

Lower bounds for the simplexity of the n-cube does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Lower bounds for the simplexity of the n-cube, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Lower bounds for the simplexity of the n-cube will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-689768