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

对“d=2与d=3维随机密堆积的显式解析解”一文的评论

Comment on "Explicit Analytical Solution for Random Close Packing in $d = 2$ and $d = 3$"

Patrick Charbonneau, Peter K. Morse

AI总结:

本文评论一篇关于二维和三维随机密堆积解析解的PRL论文,指出该方法推广到高维时与已知堵塞行为不符,说明其低维吻合可能只是巧合。

摘要:

最近发表在《物理评论快报》上的一封题为“d=2与d=3维随机密堆积的显式解析解”的信件,提出了对空间维度d=2和d=3中随机密堆积(RCP)密度的第一性原理计算。该问题有着很长的此类提议历史,但没有一个能捕捉到全貌。特别是本文,一旦推广到所有维度d,便无法描述d>4时堵塞系统的已知行为,从而表明其在低维度上的一致性在很大程度上是偶然的。

英文摘要:

A recent letter titled "Explicit Analytical Solution for Random Close Packing in d=2 and d=3" published in Physical Review Letters proposes a first-principle computation of the random close packing (RCP) density in spatial dimensions d=2 and d=3. This problem has a long history of such proposals, but none capture the full picture. This paper, in particular, once generalized to all d fails to describe the known behavior of jammed systems in d>4, thus suggesting that the low-dimensional agreement is largely fortuitous.

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

↑