Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Source. Karamanlis, published p. 5, Proposition 5 (canonical PDF). The corresponding arXiv v1–v3 result is Proposition 3.3.
Statement. For every almost-regular simplex and every integer , there is an -regular polygonal torus containing an isometric copy of . The polygon radii may differ.
Proof. By Lemma 4, the distance array of is realized by labeled points in a product of regular simplices. Matching labels gives an isometry from to those points. Write . For the prescribed common order , Lemma 3 embeds each into for a suitable . Products of these maps preserve squared distances, since each product distance is the sum of the squared distances in its factors. Composing and restricting gives an embedding of into
which is -regular.
Use. In Proposition 11, the common order is chosen first by an approximation. This proposition can use exactly that order for the corrective factor; a common radius is unnecessary.