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
复制标题
海森堡群的 L_1 嵌入和图等周法的快速估计
DOI:
10.1142/9789814324359_0110
复制
发表时间:
2010
期刊:
影响因子:
--
通讯作者:
A. Naor
中科院分区:
文献类型:
--
作者:
A. Naor
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$.