2000 character limit reached
A constructive proof of the Assouad embedding theorem with bounds on the dimension
Published 14 Nov 2012 in math.CA | (1211.3223v1)
Abstract: We give a constructive proof of a theorem of Naor and Neiman, (to appear, Revista Matematica Iberoamercana), which asserts that if $(E,d)$ is a doubling metric space, there is an integer $N > 0$, that depends only on the metric doubling constant, such that for each exponent $\alpha \in (1/2,1)$, we can find a bilipschitz mapping $F = (E,d{\alpha}) \to \RN$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.