The inscribed square problem, also known as the square peg problem or the Toeplitz' conjecture, is an unsolved question in geometry: Does every plane simple closed curve contain all four vertices of some square? This is true if the curve is convex or piecewise smooth and in other special cases. The problem was proposed by Otto Toeplitz in 1911.[1] Some early positive results were obtained by Arnold Emch[2] and Lev Schnirelmann.[3] The general case remains open.[4]
^Toeplitz, O. (1911), "Über einige Aufgaben der Analysis situs", Verhandlungen der Schweizerischen Naturforschenden Gesellschaft (in German), 94: 197
^Šnirel'man, L. G. (1944), "On certain geometrical properties of closed curves", Akademiya Nauk SSSR I Moskovskoe Matematicheskoe Obshchestvo. Uspekhi Matematicheskikh Nauk, 10: 34–44, MR0012531
^Cite error: The named reference hartnett was invoked but never defined (see the help page).