Lipschitz constant n almost surely suffices for mapping n grid points onto a cube

MaRDI QIDQ6147481zbMATH OpenFDO

Authors Michael Dymond

Publication date 15 January 2024

Full work available at URL https://arxiv.org/abs/2010.15073, http://yokohamapublishers.jp/online2/oppafa/vol8/p1661.html

zbMATH Keywords

discrete geometryLipschitz constantprobability

Mathematics Subject Classification ID

Implicit function theorems, Jacobians, transformations with several variables (26B10) Special properties of functions of several variables, Hölder conditions, etc. (26B35) Lipschitz and coarse geometry of metric spaces (51F30) Euclidean geometries (general) and generalizations (51M05) Discrete geometry (52C99)

Recommendations

• Mapping \(n\) grid points onto a square forces an arbitrarily large Lipschitz constant
• A power law for the distortion of planar sets
• scientific article; zbMATH DE number 970813
• Lipschitz representations of subsets of the cube
• Mapping analytic sets onto cubes by little Lipschitz functions

This page was built for publication: Lipschitz constant \(\log n\) almost surely suffices for mapping \(n\) grid points onto a cube

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