L_1 embeddings of the Heisenberg group and fast estimation of graph isoperimetry

Details L_1 embeddings of the Heisenberg group and fast estimation of graph isoperimetry L_1 embeddings of the Heisenberg group and fast estimation of graph isoperimetry

2010-03-22

arxiv.org/abs/1003.4261v1

Mathematics

Metric Geometry

To appear in Proceedings of the International Congress of Mathematicians, Hyderabad India, 2010

Scientific paper

We survey connections between the theory of bi-Lipschitz embeddings and the Sparsest Cut Problem in combinatorial optimization. The story of the Sparsest Cut Problem is a striking example of the deep interplay between analysis, geometry, and probability on the one hand, and computational issues in discrete mathematics on the other. We explain how the key ideas evolved over the past 20 years, emphasizing the interactions with Banach space theory, geometric measure theory, and geometric group theory. As an important illustrative example, we shall examine recently established connections to the the structure of the Heisenberg group, and the incompatibility of its Carnot-Carath\'eodory geometry with the geometry of the Lebesgue space $L_1$.

Affiliated with

Also associated with

No associations

Rating

L_1 embeddings of the Heisenberg group and fast estimation of graph isoperimetry does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with L_1 embeddings of the Heisenberg group and fast estimation of graph isoperimetry, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and L_1 embeddings of the Heisenberg group and fast estimation of graph isoperimetry will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-210664