The discrete square peg problem
Metric Geometry
2008-04-07 v1 Combinatorics
Abstract
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.
Cite
@article{arxiv.0804.0657,
title = {The discrete square peg problem},
author = {Igor Pak},
journal= {arXiv preprint arXiv:0804.0657},
year = {2008}
}