arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1707.04411math.CO
收藏

整数格上的等周性

Isoperimetry in integer lattices

Ben Barber, Joshua Erde

摘要:

图$G$的边等周问题是确定每个$n$离开任何一组$n$顶点的最小边数。在一般情况下,这个问题是NP-困难的,但在某些特殊情况下,例如当$G$是通常的整数格的精确解是已知的。本文对$\mathbb Z^d$上的每一个Cayley图渐近地解决了边等周问题。我们展示的近最佳形状是由对应于凯莱图的生成元的线段生成的地带。

英文摘要:

The edge isoperimetric problem for a graph $G$ is to determine, for each $n$, the minimum number of edges leaving any set of $n$ vertices. In general this problem is NP-hard, but exact solutions are known in some special cases, for example when $G$ is the usual integer lattice. We solve the edge isoperimetric problem asymptotically for every Cayley graph on $\mathbb Z^d$. The near-optimal shapes that we exhibit are zonotopes generated by line segments corresponding to the generators of the Cayley graph.

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

↑