arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0908.1725cond-mat.stat-mech
收藏

高维二聚体λ_d渐近展开式中各项的计算

Computation of Terms in the Asymptotic Expansion of Dimer lambda_d for High Dimension

Paul Federbush

摘要:

二聚体问题起源于对双原子分子的热力学研究,并被抽象为统计力学和组合数学中最基本、最自然的问题之一。给定一个d维体积为V的矩形格子,二聚体问题粗略地说是计算二聚体(多米诺骨牌)在格子中完全覆盖它的不同方式的数量(没有重叠)。每个二聚体覆盖两个相邻的顶点。已知当V趋于无穷大时,对于某个常数lambda_d,这种覆盖的数目大致为exp(lambda_d V)。在这里,我们提出了一个数学论证的渐近展开λ_d在d的逆幂,和计算机计算的结果,为前几项的系列。作为一个明显的挑战,我们猜想没有人会计算系列中的下一项,由于必要的计算机时间和存储需求。

英文摘要:

The dimer problem arose in a thermodynamic study of diatomic molecules, and was abstracted into one of the most basic and natural problems in both statistical mechanics and combinatoric mathematics. Given a rectangular lattice of volume V in d dimensions, the dimer problem loosely speaking is to count the number of different ways dimers (dominoes) may be laid down in the lattice (without overlapping) to completely cover it. Each dimer covers two neighboring vertices. It is known that the number of such coverings is roughly exp(lambda_d V) for some constant lambda_d as V goes to infinity. Herein we present a mathematical argument for an asymptotic expansion for lambda_d in inverse powers of d, and the results of computer computations for the first few terms in the series. As a glaring challenge, we conjecture no one will compute the next term in the series, due to the requisite computer time and storage demands.

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

↑