Simplicial grid refinement: On Freudenthal's algorithm and the optimal number of congruence classes (Q1972268)

This paper concerns the simplex refinement algorithm of \textit{H. Freudenthal} [Ann. of Math., II. Ser. 43, 580-582 (1942; Zbl 0060.40701)]. The algorithm subdivides any given \((n)\)-simplex into \(2^n\) subsimplices in such a way that recursive application results in a hierarchy of consistent triangulations. The investigations concentrate in particular on the number of congruence classes generated by recursive refinements.