We show that if an open set in $\mathbb{R}^d$ can be fibered by unit n-spheres, then $d \geq 2n+1$, and if $d = 2n+1$, then the spheres must be pairwise linked, and $n \in \left\{0, 1, 3, 7 \right\}$. For these values of n, we construct unit n-sphere fibrations in $\mathbb{R}^{2n+1}$.

We show that any embedding $\mathbb {R}^d \to \mathbb {R}^{2d+2^{\gamma (d)}-1}$ inscribes a trapezoid or maps three points to a line, where $2^{\gamma (d)}$ is the smallest power of $2$ satisfying $2^{\gamma (d)} \geq \rho (d)$, and $\rho (d)$ denotes the Hurwitz–Radon function. The proof is elementary and includes a novel application of nonsingular bilinear maps. As an application, we recover recent results on the nonexistence of affinely $3$-regular maps, for infinitely many dimensions $d$, without resorting to sophisticated algebraic techniques.

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.