The discrete square peg problem
| dc.creator | Pak, Igor | |
| dc.date | 2008-04-04 | |
| dc.date.accessioned | 2026-07-07T09:30:25Z | |
| dc.date.available | 2026-07-07T09:30:25Z | |
| dc.description | The square peg problem asks whether every Jordan curve in the plane has four points which form a square. The problem has been resolved (positively) for various classes of curves, but remains open in full generality. We present two new direct proofs for the case of piecewise linear curves. | |
| dc.identifier | https://arxiv.org/abs/0804.0657 | |
| dc.identifier | http://arxiv.org/abs/0804.0657 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/158117 | |
| dc.subject | Metric Geometry | |
| dc.subject | Combinatorics | |
| dc.subject | 53A04; 52C99; | |
| dc.title | The discrete square peg problem | |
| dc.type | text |