arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2103.10523math.CO
收藏

平面重图复杂度和素矩形平方的界的初等证明

Elementary proof for the bounds of the complexity of a planar multigraph and the size of a prime rectangular squaring

Dmitri Fomin

摘要:

两个结果(连同他们的相对初级的证明)。第一个给出了有限平面多重图的生成树个数的上界,证明了具有$n$边的平面多重图的复杂度(生成树个数)不超过$τ^n$,其中$τ\approx 1.8637$ .这个结果很可能是已知的和/或已发布的-我的快速网络搜索没有发现任何东西,但这并不能真正证明什么。这个不等式对于$τ^* \approx 1.7916$的“最佳可能”值实际上是正确的,这似乎也是合理的。第二个结果利用上述定理改进了著名的关于素数矩形平方中瓦片个数的Conway不等式。

英文摘要:

Two results (together with their relatively elementary proofs) are presented. The first one presents the upper boundary on the number of spanning trees in a finite planar multigraph, proving that the complexity (the number of spanning trees) of a planar multigraph with $n$ edges does not exceed $τ^n$, where $τ\approx 1.8637$. This result is, quite possibly, already known and/or published -- my quick web search did not turn up anything but that does not really prove much. It also seems plausible that this inequality is actually true for the "best possible" value of $τ^* \approx 1.7916$. The second result uses the above theorem to improve on the well-known Conway's inequality for the number of tiles in a prime rectangular squaring.

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

↑