Inscribed square problem
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. Some early positive results were obtained by Arnold Emch and Lev Schnirelmann. As of 2022, the general case remains open.
Inscribed square problem - Wikipedia Jump to content From Wikipedia, the free encyclopedia Unsolved problem about inscribing a square in a Jordan curve Unsolved problem in mathematics Does every Jordan curve have an inscribed square? More unsolved problems in mathematics Example: The black dashed curve goes through all corners of several blue squares. 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 co
saved by
related reading
- An OpenAI model has disproved a central conjecture in discrete geometry | OpenAIopenai.com
- Jacobian conjecture - Wikipediaen.wikipedia.org
- Squaring the circle - Wikipediaen.wikipedia.org
- On Packing Squares with Equal Squaresfanchung.ucsd.edu
- Square Theory | Adam Aaronsonaaronson.org
- Schröder–Bernstein theorem - Wikipediaen.wikipedia.org
- Steiner's conic problem - Wikipediaen.wikipedia.org
- KS.pdfraghavsomani.github.io
- [2309.09973] Monochromatic boxes of unit volumearxiv.org
- A digestion of the Jacobian conjecture counterexampleterrytao.wordpress.com
- Arnold's proof of Abel-Ruffiniweb.williams.edu
- Bing’s wild involution | Geometry and the imaginationlamington.wordpress.com