arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2301.13161math.NAcond-mat.softcs.NA
收藏

六边形的回响:正多边形内部六边形堆积的残留结构

Echoes of the hexagon: remnants of hexagonal packing inside regular polygons

Paolo Amore, Mauricio Carrizalez, Ulises Zarate

AI总结:

本研究通过数值模拟与自主设计的高效算法,发现边数为6的倍数的正多边形内存在与六边形堆积相关的高对称圆盘堆积构型,刻画了弯曲六边形堆积(CHP)的性质并提出可生成所有对应CHP构型的确定性算法。

摘要:

基于我们开展的数值模拟,我们提供了如下证据:对于边数为$σ=6j$($j=2,3,\boldsymbol{\dots}$)的正多边形,$N(k)=3k(k+1)+1$($k=1,2,\boldsymbol{\dots}$)个尺寸合适的全等圆盘可以以高度对称的构型在这些多边形内部实现良好堆积,在$N$足够小时,这类构型的堆积密度显然达到最大值。这些构型在$\boldsymbol{\pi/3}$的旋转操作下保持不变,与正六边形中完美六边形堆积的构型,以及Graham和Lubachevsky很久以前在圆形区域中发现的“弯曲六边形堆积”(curved hexagonal packing,CHP)构型密切相关。\n我们的探索以自主设计的算法为基础,这些算法能高效生成正多边形内部的CHP构型及更具一般性的堆积构型。我们利用这些算法生成了针对不同正多边形、不同圆盘数量的大量CHP构型;通过对这些结果的细致研究,我们得以全面刻画CHP构型的一般性质,并设计出一种确定性算法:只要指定合适的输入(即“DNA”),该算法就能完整组装出给定的CHP构型。\n我们的分析表明,对于给定的圆盘数$N$,CHP构型的数量在堆积分数上具有高度简并性,且可以通过$k$(壳层数)、DNA本身的构造单元,以及基本域内的顶点数(由于对称性,我们在整个域的1/6区域内开展研究)进行显式计算。借助我们的确定性算法,我们能够构建出具有$k$层壳的正多边形对应的所有CHP构型。

英文摘要:

Based on numerical simulations that we have carried out, we provide evidence that for regular polygons with $σ= 6j$ sides (with $j=2,3,\dots$), $N(k)=3 k (k+1)+1$ (with $k=1,2,\dots$) congruent disks of appropriate size can be nicely packed inside these polygons in highly symmetrical configurations which apparently have maximal density for $N$ sufficiently small. These configurations are invariant under rotations of $π/3$ and are closely related to the configurations with perfect hexagonal packing in the regular hexagon and to the configurations with {\sl curved hexagonal packing} (CHP) in the circle found long time ago by Graham and Lubachevsky. At the basis of our explorations are the algorithms that we have devised, which are very efficient in producing the CHP and more general configurations inside regular polygons. We have used these algorithms to generate a large number of CHP configurations for different regular polygons and numbers of disks; a careful study of these results has made possible to fully characterize the general properties of the CHP configurations and to devise a {\sl deterministic} algorithm that completely ensembles a given CHP configuration once an appropriate input ("DNA") is specified. Our analysis shows that the number of CHP configurations for a given $N$ is highly degenerate in the packing fraction and it can be explicitly calculated in terms of $k$ (number of shells), of the building block of the DNA itself and of the number of vertices in the fundamental domain (because of the symmetry we work in $1/6$ of the whole domain). With the help of our deterministic algorithm we are able to build {\sl all} the CHP configurations for a polygon with $k$ shells.

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

↑