English

Mapping $n$ grid points onto a square forces an arbitrarily large Lipschitz constant

Metric Geometry 2018-08-28 v4 Discrete Mathematics Functional Analysis

Abstract

We prove that the regular n×nn\times n square grid of points in the integer lattice Z2\mathbb{Z}^{2} cannot be recovered from an arbitrary n2n^{2}-element subset of Z2\mathbb{Z}^{2} via a mapping with prescribed Lipschitz constant (independent of nn). This answers negatively a question of Feige from 2002. Our resolution of Feige's question takes place largely in a continuous setting and is based on some new results for Lipschitz mappings falling into two broad areas of interest, which we study independently. Firstly the present work contains a detailed investigation of Lipschitz regular mappings on Euclidean spaces, with emphasis on their bilipschitz decomposability in a sense comparable to that of the well known result of Jones. Secondly, we build on work of Burago and Kleiner and McMullen on non-realisable densities. We verify the existence, and further prevalence, of strongly non-realisable densities inside spaces of continuous functions.

Keywords

Cite

@article{arxiv.1704.01940,
  title  = {Mapping $n$ grid points onto a square forces an arbitrarily large Lipschitz constant},
  author = {Michael Dymond and Vojtěch Kaluža and Eva Kopecká},
  journal= {arXiv preprint arXiv:1704.01940},
  year   = {2018}
}

Comments

60 pages (43 pages of the main part, 13 pages of appendices), 10 figures. This is a revised version according to referees' comments. Our version of the proof of the theorem about bilipschitz decomposition of Lipschitz regular mappings was greatly simplified. To appear in GAFA

R2 v1 2026-06-22T19:09:59.504Z