November 8, 2019
Inscribing rectangles in Jordan Loops
Rich Schwartz (Brown)
SCEN 322, 11/8/19 at 3:00 pm to 3:50 pm
The notorious square peg problem of Toeplitz, from 1911, asks if every Jordan curve has 4 points which form the vertices of squares. I will show a computer program I wrote which investigates this and related problems. I'll give a computer demonstration, and fairly complete explanation, of my result that all but at most 4 points of any Jordan curve are vertices of inscribed rectangles.