vix.ing · top · new · best · stats · spec

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

2017/04/30 by Michael Dymond, Vojtěch Kaluža, Eva Kopecká · 1 citation
Computer Science · Mathematics · #cs.DM #math.FA #math.MG #msc:26B10 #msc:26B35 #msc:51F99 #msc:51M05 #msc:52C99

paper · pdf · doi:10.1007/s00039-018-0445-z

published as Geom. Funct. Anal. (2018) 28: 589 · 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

arxiv created 2018/02/27 · arxiv updated 2018/08/28

Abstract

We prove that the regular n× n square grid of points in the integer lattice ℤ2 cannot be recovered from an arbitrary n2-element subset of ℤ2 via a mapping with prescribed Lipschitz constant (independent of n). 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.

Cited by