arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1003.4261math.MGcs.DSmath.FA
收藏

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

Assaf 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éodory geometry with the geometry of the Lebesgue space $L_1$.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑