完美长方体所需的新性质及寻求它的高效算法
Novel required properties of, and efficient algorithms to seek, perfect cuboids
AI总结:
本文提出两个基于完美基座分析的高效计算机搜索算法,用于探究完美长方体是否存在,并发现新的双参数边长方体族及大量不可能出现的纵横比。
摘要:
我们针对完美长方体是否存在这一古老问题提出一种新方法。该方法包含两个新的计算机搜索算法,它们源于我们中一位作者最近报告的“完美基座”分析,其效率远高于我们所知的任何先前算法。利用该方法,我们还(i)识别出一些新的双参数边长方体族,并且(ii)证明面或内部矩形的纵横比中很大一部分不可能出现在完美长方体中,这一性质此前仅对纵横比为4:3的面有过报道。
英文摘要:
We present a novel approach to the age-old question of whether perfect cuboids exist. Our approach consists of two new computer search algorithms, arising from the analysis of "perfect plinths" reported by one of us recently, that are much more efficient than any prior algorithm of which we are aware. Using this approach, we also (i) identify some new two-parameter families of edge cuboids, and (ii) show that large proportions of aspect ratios of faces or internal rectangles cannot be present in a perfect cuboid, a property that was previously reported only for faces with the aspect ratio 4:3.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。