Let $\Delta $ denote a nondegenerate k-simplex in $\mathbb {R}^k$. The set $\operatorname {\mathrm {Sim}}(\Delta )$ of simplices in $\mathbb {R}^k$ similar to $\Delta $ is diffeomorphic to $\operatorname {O}(k)\times [0,\infty )\times \mathbb {R}^k$, where the factor in $\operatorname {O}(k)$ is a matrix called the pose. Among $(k-1)$-spheres smoothly embedded in $\mathbb {R}^k$ and isotopic to the identity, there is a dense family of spheres, for which the subset of $\operatorname {\mathrm {Sim}}(\Delta )$ of simplices inscribed in each embedded sphere contains a similar simplex of every pose $U\in \operatorname {O}(k)$. Further, the intersection of $\operatorname {\mathrm {Sim}}(\Delta )$ with the configuration space of $k+1$ distinct points on an embedded sphere is a manifold whose top homology class maps to the top class in $\operatorname {O}(k)$ via the pose map. This gives a high-dimensional generalisation of classical results on inscribing families of triangles in plane curves. We use techniques established in our previous paper on the square-peg problem where we viewed inscribed simplices in spheres as transverse intersections of submanifolds of compactified configuration spaces.

Toeplitz conjectured that any simple planar loop inscribes a square. Here we prove variants of Toeplitz’s square peg problem. We prove Hadwiger’s 1971 conjecture that any simple loop in $3$-space inscribes a parallelogram. We show that any simple planar loop inscribes sufficiently many rectangles that their vertices are dense in the loop. If the loop is rectifiable, there is a rectangle that cuts the loop into four pieces which can be rearranged to form two loops of equal length. (The previous two results are independently due to Schwartz.) A rectifiable loop in $d$-space can be cut into $(r-1)(d+1)+1$ pieces that can be rearranged by translations to form $r$ loops of equal length. We relate our results to fair divisions of necklaces in the sense of Alon and to Tverberg-type results. This provides a new approach and a common framework to obtain inscribability results for the class of all continuous curves.

The classification of Euclidean frieze groups into seven conjugacy classes is well known, and many articles on recreational mathematics contain frieze patterns that illustrate these classes. However, it is only possible to draw these patterns because the subgroup of translations that leave the pattern invariant is (by definition) cyclic, and hence discrete. In this paper we classify the conjugacy classes of frieze groups that contain a non-discrete subgroup of translations, and clearly these groups cannot be represented pictorially in any practicalway. In addition, this discussion sheds light onwhy there are only seven conjugacy classes in the classical case.