Papers › On the Square Peg Problem and Its Relatives
On the Square Peg Problem and Its Relatives
Benjamin Matschke
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
Toeplitz's Square Peg Problem asks whether every continuous simple closed curve in the plane contains the four vertices of a square. It has been proved for various classes of sufficiently smooth curves, some of which are dense, none of which are open. In this paper we prove it for several open classes of curves, one of which is also dense. This can be interpreted in saying that the Square Peg Problem is solved for generic curves. The latter class contains all previously known classes for which the Square Peg Problem has been proved in the affirmative. [footnote] We also prove results about rectangles inscribed in immersed curves. Finally, we show that the problem of finding a regular octahedron on metric 2-spheres has a "topological counter-example", that is, a certain test map with boundary condition exists.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections