On the nonexistence of k-reptile tetrahedra

Details On the nonexistence of k-reptile tetrahedra On the nonexistence of k-reptile tetrahedra

2010-06-09

arxiv.org/abs/1006.1807v1

Mathematics

Combinatorics

11 pages, 3 figures

Scientific paper

A d-dimensional simplex S is called a k-reptile if it can be tiled without overlaps by simplices S_1,S_2,...,S_k that are all congruent and similar to S. For d=2, k-reptile simplices (triangles) exist for many values of k and they have been completely characterized by Snover, Waiveris, and Williams. On the other hand, for d > 2, only one construction of k-reptile simplices is known, the Hill simplices, and it provides only k of the form m^d, m=2,3,.... We prove that for d=3, k-reptile simplices (tetrahedra) exist only for k=m^3. This partially confirms a conjecture of Hertel, asserting that the only k-reptile tetrahedra are the Hill tetrahedra. Our research has been motivated by the problem of probabilistic packet marking in theoretical computer science, introduced by Adler in 2002.

Affiliated with

Also associated with

No associations

Rating

On the nonexistence of k-reptile tetrahedra 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 On the nonexistence of k-reptile tetrahedra, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the nonexistence of k-reptile tetrahedra will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-39937