arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1509.02810cond-mat.softcond-mat.stat-mech
收藏

斑图形成和最佳填充

Pattern formations and optimal packing

Vladimir Mityushev

摘要:

在反应扩散方程解之后,可能会出现不同对称性的图案。通过对相应的初边值问题的数值求解,在不同的模型中观察到了非线性的扰动、非线性的扰动和非线性的扰动。我们证明了平面上的斑图形成和最优随机堆积之间的密切联系。本文的研究主要基于以下两点。首先,在结构近似的框架下,反应扩散系统中的扩散通量近似为分段线性函数。这导致所考虑的连续问题的离散网络近似。其次,离散能量最小化产生代表性细胞中的域(盘)的最佳随机包装。因此,基于反应扩散方程的一般斑图形成问题被简化为随机堆积的几何问题。它表明,所有的随机包装可以划分到类与类的同构图得到的形式的Delaunay三角剖分。在每一类随机填充中构造了唯一的最优解。如果每个代表胞元的圆盘数是有限的,则同构图的类数,从而最优填充数也是有限的。

英文摘要:

Patterns of different symmetries may arise after solution to reaction-diffusion equations. Hexagonal arrays, layers and their perturbations are observed in different models after numerical solution to the corresponding initial-boundary value problems. We demonstrate an intimate connection between pattern formations and optimal random packing on the plane. The main study is based on the following two points. First, the diffusive flux in reaction-diffusion systems is approximated by piecewise linear functions in the framework of structural approximations. This leads to a discrete network approximation of the considered continuous problem. Second, the discrete energy minimization yields optimal random packing of the domains (disks) in the representative cell. Therefore, the general problem of pattern formations based on the reaction-diffusion equations is reduced to the geometric problem of random packing. It is demonstrated that all random packings can be divided onto classes associated with classes of isomorphic graphs obtained form the Delaunay triangulation. The unique optimal solution is constructed in each class of the random packings. If the number of disks per representative cell is finite, the number of classes of isomorphic graphs, hence, the number of optimal packings is also finite.

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

↑