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

平面折叠的高效枚举:随机单顶点折纸研究

An Efficient Enumeration of Flat-Foldings : Study on Random Single Vertex Origami

Chihiro Nakajima

AI总结:

本文针对随机单顶点折纸的平面折叠计数与枚举问题,提出基于统计力学物理模型和尺寸缩减的高效近似枚举方法,并探讨其与强制集及计算复杂度的关系。

摘要:

本文涉及的主题包括:随机折纸图中平面折叠总数的近似计数/评估、各种实例上平均值的评估、为一般折纸图获取强制集,以及平均计算复杂度的评估。本文提出了一种利用物理模型和高效尺寸缩减方法来处理上述问题的方法。通过使用统计力学模型和基于该模型的近似枚举数值方法,我们给出了对围绕中心顶点聚集且角度宽度随机的单顶点折纸图的平面折叠总数进行近似枚举的结果,并获得了其尺寸依赖性,以用于向无限尺寸极限的渐近预测。此外,从组织物理模型中所含项的角度,本文还提供了关于由禁止面片相互穿透的约束所导致的局部堆叠顺序链式确定问题的展望。基于上述视角,本文讨论了一种高效求解平面折叠确定或枚举问题的方法。这被认为与强制集密切相关。

英文摘要:

This paper deals with themes such as approximate counting/evaluation of the total number of flat-foldings for random origami diagrams, evaluation of the values averaged over various instances, obtaining forcing sets for general origami diagrams, and evaluation of average computational complexity. An approach to the above problems using a physical model and an efficient size reduction method for them is proposed. Using a statistical mechanics model and a numerical method of approximate enumeration based on it, we give the result of approximate enumeration of the total number of flat-foldings of single-vertex origami diagram with random width of angles gathering around the central vertex, and obtain its size dependence for an asymptotic prediction towards the limit of infinite size. In addition, an outlook with respect to the chained determination of local stacking orders of facets caused by the constraint that prohibits the penetration of them is also provided from the viewpoint of organizing the terms included in the physical model. A method to efficiently solve the problem of the determination or enumeration of flat-foldings is discussed based on the above perspectives. This is thought to be closely related to forcing sets.

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

↑