## Abstract

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éodory geometry with the geometry of the Lebesgue space L_{1}.

Original language | English (US) |
---|---|

Title of host publication | Proceedings of the International Congress of Mathematicians 2010, ICM 2010 |

Pages | 1549-1575 |

Number of pages | 27 |

State | Published - 2010 |

Externally published | Yes |

Event | International Congress of Mathematicians 2010, ICM 2010 - Hyderabad, India Duration: Aug 19 2010 → Aug 27 2010 |

### Publication series

Name | Proceedings of the International Congress of Mathematicians 2010, ICM 2010 |
---|

### Other

Other | International Congress of Mathematicians 2010, ICM 2010 |
---|---|

Country/Territory | India |

City | Hyderabad |

Period | 8/19/10 → 8/27/10 |

## All Science Journal Classification (ASJC) codes

- Mathematics(all)

## Keywords

- Bi-Lipschitz embeddings
- Heisenberg group
- Sparsest Cut Problem

## Fingerprint

Dive into the research topics of 'L_{1}embeddings of the Heisenberg group and fast estimation of graph isoperimetry'. Together they form a unique fingerprint.