arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1212.6973math.APmath.OC
收藏

具有Wasserstein相互作用的粒子系统的三角格子的最优性

Optimality of the triangular lattice for a particle system with Wasserstein interaction

D. P. Bourne, M. A. Peletier, F. Theil

摘要:

我们证明了强结晶结果在两个维度的能量,在嵌段共聚物的理论中出现。能量定义在点集及其权重上,或者等价地定义在原子测度集上。它由两个术语组成;首项是权重的平方根之和,第二项是原子测度和勒贝格测度之间的二次最优输运成本。我们证明了这个系统允许结晶在几个不同的方式:(1)能量是有界的从下面的能量的三角晶格(称为$\mathcal T$);(2)如果能量等于$\mathcal T$的能量,则该度量是$\mathcal T$的旋转和平移副本;(3)如果能量接近于$\mathcal T$的能量,则该测度局部地接近于$\mathcal T$的旋转和平移的副本。这三个结果要求域是最多有六条边的多边形。第四个结果指出,能量的$\mathcal T$可以实现在大域的限制,域与任意边界。校样使用三种成分。首先,最优输运成本将每个点与一个多边形单元相关联;能量可以由仅取决于该单元的函数的所有单元的总和从下面限定。其次,该函数具有凸下界,在$\mathcal T$处是尖锐的。第三,欧拉多面体公式将多边形单元的平均边数限制为6,其中6是对应于三角形晶格的数。

英文摘要:

We prove strong crystallization results in two dimensions for an energy that arises in the theory of block copolymers. The energy is defined on sets of points and their weights, or equivalently on the set of atomic measures. It consists of two terms; the first term is the sum of the square root of the weights, and the second is the quadratic optimal transport cost between the atomic measure and the Lebesgue measure. We prove that this system admits crystallization in several different ways: (1) the energy is bounded from below by the energy of a triangular lattice (called $\mathcal T$); (2) if the energy equals that of $\mathcal T$, then the measure is a rotated and translated copy of $\mathcal T$; (3) if the energy is close to that of $\mathcal T$, then locally the measure is close to a rotated and translated copy of $\mathcal T$. These three results require the domain to be a polygon with at most six sides. A fourth result states that the energy of $\mathcal T$ can be achieved in the limit of large domains, for domains with arbitrary boundaries. The proofs make use of three ingredients. First, the optimal transport cost associates to each point a polygonal cell; the energy can be bounded from below by a sum over all cells of a function that depends only on the cell. Second, this function has a convex lower bound that is sharp at $\mathcal T$. Third, Euler's polytope formula limits the average number of sides of the polygonal cells to six, where six is the number corresponding to the triangular lattice.

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

↑