Inscribing rectangles in Jordan curves

Geometry and Mathematical Physics Seminar
Speaker: Joshua Greene, Boston College
Title: Inscribing rectangles in Jordan curves
Abstract: The Square Peg Problem (Toeplitz, 1911) asks whether every Jordan curve in the Euclidean plane contains the vertices of a square. One can reasonably ask the same question with any prescribed (similarity class of) rectangle in place of the square. I will describe joint work with Andrew Lobb, in which we define a Floer chain complex generated by the inscriptions of a given rectangle in a smooth Jordan curve. The resulting homology group is nonzero, which implies that every rectangle inscribes in every smooth Jordan curve. The groups also carry a real-valued grading, which can be used to go beyond the case of smoothness. I will discuss how to use the grading to prove results about inscribing rectangles in both rectifiable and arbitrary Jordan curves.