Planar Bilipschitz Extension from Separated Nets
Michael Dymond, Vojt\v{e}ch Kalu\v{z}a

TL;DR
This paper proves that bilipschitz maps from separated nets in the plane can be extended to the entire plane with controlled distortion, solving longstanding open problems in geometric analysis.
Contribution
It establishes polynomial bounds for extending bilipschitz maps from separated nets in b2 to b2, generalizing previous results and answering open questions.
Findings
Extension of bilipschitz maps from b2 to b2 with polynomial bounds
Extension results for separated nets in b2
Resolution of a decades-old open problem in geometric analysis
Abstract
We prove that every -bilipschitz mapping can be extended to a -bilipschitz mapping and provide a polynomial upper bound for . Moreover, we extend the result to every separated net in instead of , with the upper bound gaining a polynomial dependence on the separation and net constants associated to the given separated net. This answers an Oberwolfach question of Navas from 2015 and is also a positive solution of the two-dimensional form of a decades old open (in all dimensions at least two) problem due to Alestalo, Trotsenko and V\"ais\"al\"a.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsData Management and Algorithms · Rough Sets and Fuzzy Logic · Advanced Database Systems and Queries
