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

From MaRDI portal
Publication:724264

DOI10.1007/S00039-018-0445-ZzbMATH Open1404.26017arXiv1704.01940OpenAlexW2612138444WikidataQ129931764 ScholiaQ129931764MaRDI QIDQ724264FDOQ724264


Authors: Michael Dymond, Vojtěch Kaluža, Eva Kopecká Edit this on Wikidata


Publication date: 25 July 2018

Published in: Geometric and Functional Analysis. GAFA (Search for Journal in Brave)

Abstract: We prove that the regular nimesn square grid of points in the integer lattice mathbbZ2 cannot be recovered from an arbitrary n2-element subset of mathbbZ2 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.


Full work available at URL: https://arxiv.org/abs/1704.01940




Recommendations




Cites Work


Cited In (6)





This page was built for publication: Mapping \(n\) grid points onto a square forces an arbitrarily large Lipschitz constant

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q724264)