arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2601.14904math.CO
收藏

关于矩阵最大密度与超越型图论密度

On the maximum density of a matrix and a transcendental Turán-type density

University of Haifa(海法大学)

Raphael Yuster

AI总结:

本文研究了矩阵的最大密度问题,证明了特定图的诱导性,并构造了极小化矩阵。

摘要:

我们证明了在有序单调平衡二分图中诱导$P_4$的诱导性为$2/e^2$,建立了具有超越型图论密度的最小已知图。此外,极限对象是一个二元图隆,因此它生成一个确定性模型。这是本文所讨论的更一般框架的一个特殊情况——在大且可能单调的矩阵上,常数矩阵在任意符号集上的渐近最大密度。我们解决了所有$2 \times 2$单调情况(其中一个对应于上述$P_4$)和所有但一个的$2 \times 2$无限制情况。虽然$(h!/h^h)^2$是$h \times h$矩阵渐近最大密度的下界,但我们为所有$h \ge 1$显式构造了一个$h \times h$的极小化器,即一个使得此下界达到的矩阵。我们还简要说明了如何将已知的图诱导性结果修改以证明,当$h$增长时,几乎所有$h \times h$的$0/1$矩阵都是极小化器。

英文摘要:

We prove that the inducibility of $P_4$ in ordered monotone balanced bipartite graphs is $2/e^2$, establishing the smallest known graph with transcendental Turán-type density. Moreover, the limit object is a binary graphon, so it generates a deterministic model. This is a special case of a more general framework addressed here -- the asymptotic maximum density of a constant matrix over an arbitrary symbol set, in a large, possibly monotone, matrix. We solve all $2 \times 2$ monotone cases (one of which corresponds to the aforementioned $P_4$) and all but one of the $2 \times 2$ unrestricted cases. While $(h!/h^h)^2$ is a lower bound for the asymptotic maximum density of an $h \times h$ matrix, we explicitly construct, for all $h \ge 1$, an $h \times h$ minimizer, i.e., a matrix for which this bound is attained. We also sketch how known results on the inducibility of graphs can be modified to show that, as $h$ grows, almost all $h \times h$ $0/1$ matrices are minimizers.

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

↑