Papers
Topics
Authors
Recent
Search
2000 character limit reached

Lipschitz free spaces on finite metric spaces

Published 10 Jul 2018 in math.FA and math.MG | (1807.03814v1)

Abstract: Main results of the paper: (1) For any finite metric space $M$ the Lipschitz free space on $M$ contains a large well-complemented subspace which is close to $\ell_1n$. (2) Lipschitz free spaces on large classes of recursively defined sequences of graphs are not uniformly isomorphic to $\ell_1n$ of the corresponding dimensions. These classes contain well-known families of diamond graphs and Laakso graphs. Interesting features of our approach are: (a) We consider averages over groups of cycle-preserving bijections of graphs which are not necessarily graph automorphisms; (b) In the case of such recursive families of graphs as Laakso graphs we use the well-known approach of Gr\"unbaum (1960) and Rudin (1962) for estimating projection constants in the case where invariant projections are not unique.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.