ZZPolyCalc:一个带有片段缓存的开源代码,用于确定碳纳米结构的Zhang-Zhang多项式
ZZPolyCalc: An open-source code with fragment caching for determination of Zhang-Zhang polynomials of carbon nanostructures
AI总结:
ZZPolyCalc是一个开源程序,通过基于哈希的片段缓存簿记算法高效计算大型碳纳米结构的Zhang-Zhang多项式,显著降低了计算时间并突破了原有规模限制。
摘要:
确定石墨烯薄片、纳米管和富勒烯的拓扑不变量是一项具有挑战性的任务,因为其耗时且呈指数级扩展。这些不变量可以组织成组合多项式的形式,通常被称为Zhang-Zhang (ZZ) 多项式或Clar覆盖多项式。我们在此报告一个计算机程序ZZPolyCalc,专门设计用于计算大型碳纳米结构的ZZ多项式。通过采用一种复杂的簿记算法,对于一大类纳米结构避免了指数级扩展的诅咒,其中递归分解中出现的每个片段都存储在分子片段的缓存库中,该库由相应邻接矩阵的哈希索引。尽管对于其余纳米结构仍存在指数级扩展,但由于高效使用基于哈希的片段簿记,计算时间减少了几个数量级。提供的基准计时表明,ZZPolyCalc能够处理比以前设想的大得多的碳纳米结构。
英文摘要:
Determination of topological invariants of graphene flakes, nanotubes, and fullerenes constitutes a challenging task due to its time-intensive nature and exponential scaling. The invariants can be organized in a form of a combinatorial polynomial commonly known as the Zhang-Zhang (ZZ) polynomial or the Clar covering polynomial. We report here a computer program, ZZPolyCalc, specifically designed to compute ZZ polynomials of large carbon nanostructures. The curse of exponential scaling is avoided for a broad class of nanostructures by employing a sophisticated bookkeeping algorithm, in which each fragment appearing in the recursive decomposition is stored in the cache repository of molecular fragments indexed by a hash of the corresponding adjacency matrix. Although exponential scaling persists for the remaining nanostructures, the computational time is reduced by a few orders of magnitude owing to efficient use of hash-based fragment bookkeeping. The provided benchmark timings show that ZZPolyCalc allows for treating much larger carbon nanostructures than previously envisioned.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。