$(\mathbb{N}^2,\infty)$中的边等周问题
The Edge-Isoperimetric Problem in $(\mathbb{N}^2,\infty)$
摘要:
在$\ell_{\infty}$度量下,考虑无限网格$\mathbb{N}^{2}$图上的边等周问题.我们首先表明,解决方案是不嵌套的,因此,必须使用压缩以外的技术。然后,我们表明,对于任何给定的体积集$\mathbb{N}^{2}$,存在一个最佳的一个特定的几何形式,并描述这种形式。我们继续证明了最优周长具有作为体积的函数的渐近增长率$2\sqrt{7x}$,并得到了最优周长的下界,它们都在彼此的小加常数$\frac{35}{2}$之内,从而有效地解决了该图上的离散等周不等式.最后,我们证明了存在任意长的连续值的体积的最小周长是相同的。
英文摘要:
We consider the edge-isoperimetric problem on the graph of the infinite grid $\mathbb{N}^{2}$ in the $\ell_{\infty}$ metric. We first show that the solutions are not nested, so that techniques other than compressions have to be used. We then show that for any given volume of sets in $\mathbb{N}^{2}$, there exists an optimal set of a specific geometric form and describe this form. We continue on to prove that the optimal perimeter has asymptotic growth rate $2\sqrt{7x}$ as a function of the volume and obtain upper and lower bounds for the optimal perimeter which are within the small additive constant of $\frac{35}{2}$ of one another, thus effectively solving the discrete isoperimetric inequality on this graph. Finally, we prove that there exist arbitrarily long consecutive values of the volume for which the minimum perimeter is the same.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。