author={Richard Jerrard},
  journal={Transactions of the American Mathematical Society},
  • R. Jerrard
  • Published 1 February 1961
  • Mathematics
  • Transactions of the American Mathematical Society
Consider a simple, closed, plane curve C which is a real-analytic image of the unit circle, and which is given by x = x(t), y = y(t). These are real analytic periodic functions with period T. In the following paper it is shown that in a certain definite sense, exactly an odd number of squares can be inscribed in every such curve which does not contain an infinite number of inscribed squares. This theorem is similar to the theorem of Kakutani [1] that there exists a circumscribing cube around… 

Inscribed squares and square-like quadrilaterals in closed curves

We show that for every smooth curve in R n , there is a quadrilateral with equal sides and equal diagonals whose vertices lie on the curve. In the case of a smooth plane curve, this implies that the

Square-like quadrilaterals inscribed in embedded space curves

The square-peg problem asks if every Jordan curve in the plane has four points which are the vertices of a square. The problem is open for continuous Jordan curves, but it has been resolved for

Rectangles, curves, and Klein bottles. (English)

It contains proofs of M. D. Meyerson’s theorem [Fundam. Math. 110, 1–9 (1980; Zbl 0372.57003)], that all but at most two points of an arbitrary Jordan curve are vertices of an inscribed equilateral

The Inscribed Square Conjecture in the Digital Plane

It is proved that the conjecture that any plane Jordan curve J contains four points on a non-degenerate square holds for digital simple closed 4-curves, and that it is false for 8-Curves.

On the Square Peg Problem and Its Relatives

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


    T. Tao
    Forum of Mathematics, Sigma
  • 2017
The ‘square peg problem’ or ‘inscribed square problem’ of Toeplitz asks if every simple closed curve in the plane inscribes a (nondegenerate) square, in the sense that all four vertices of that

The algebraic square peg problem

The square peg problem asks whether every continuous curve in the plane that starts and ends at the same point without self-intersecting contains four distinct corners of some square. Toeplitz

Polygons inscribed in Jordan curves with prescribed edge ratios

Let J be a Jordan curve which has continuously turning tangents in some arc. For a tuple of positive numbers a 1 , · · · , a n , each of which is less than the sum of the others, we show that there

A Combinatorial Approach to the Inscribed Square Problem

The inscribed square conjecture, also known as Toeplitz’ conjecture or the square peg problem, asserts that every Jordan curve in the Euclidean plane admits an inscribed square. Although there exists

Circumscribed cubes in euclidean $n$-space

Communicated by R. H. Bing, May 20, 1959 Let E be a euclidean ^-space with a rectangular cartesian coordinate system (x) — (xi, • • • , xn), and let (y) be any system which is a rotation of (x). Let