Simplicial grid refinement: on Freudenthal's algorithm and the optimal number of congruence classes

In the present paper we investigate Freudenthal's simplex reenement algorithm which can be considered to be the canonical generalization of Bank's well known red reene-ment strategy for triangles. Freudenthal's algorithm subdivides any given (n)-simplex into 2 n subsimplices, in such a way that recursive application results in a stable hierarchy of consistent triangulations. Our investigations concentrate in particular on the number of congruence classes generated by recursive reenements. After presentation of the method and the basic ideas behind it, we will show that Freudenthal's algorithm produces at most n!=2 congruence classes for any initial (n)-simplex, no matter how many subsequent reenements are performed. Moreover, we will show that this number is optimal in the sense that recursive application of any aane invariant reenement strategy with 2 n sons per element results in at least n!=2 congruence classes for almost all (n)-simplices.