多重独立多项式的下界及其推广
Lower bounds for multivariate independence polynomials and their generalisations
AI总结:
本文研究了多重独立多项式的下界及其推广,提出并证明了关于图的独立集的不等式,并推测该结果可推广至其他反铁磁模型。
摘要:
在统计物理中,多重硬芯模型描述了一组粒子,每个粒子都有自己的 fugacity(逸度)。在图论语言中,该模型的配分函数转化为多重独立多项式,即独立多项式的多维推广,定义为 $Z_G(λ_1,\dots,λ_n) := \sum_{I\in\mathcal{I}(G)} \prod_{v\in I}λ_v$,其中 $\mathcal{I}(G)$ 表示图 $G$ 上所有独立集的集合。我们证明,对于任意简单图 $G$ 上的 $[n]:=\{1,2,\dots,n\}$ 和 $λ_1,\dots,λ_n\geq 0$,有 \n $Z_G(λ_1,\dots,λ_n) \geq \prod_{i=1}^n (1+(d_i+1)λ_i)^{1/(d_i+1)}$,其中 $d_1,\dots,d_n$ 是图 $G$ 的度数序列。这扩展了 Sah、Sawhney、Stoner 和 Zhao 的结果,他们证明了单变量情况 $λ_1=\dots=λ_n=λ$。我们进一步推测我们的不等式应能推广到其他反铁磁模型,并给出一些支持证据。特别是对于 $λ_i,μ_i\geq 0$,$1\leq i\leq n$,我们得到一个更强的不等式 \n $\sum_{\substack{I,J\in \mathcal{I}(G) \\ I\cap J=\emptyset}} \prod_{v\in I}λ_v\prod_{u\in J}μ_u$ \n $\geq \prod_{i=1}^n \left(1+(d_i+1)(λ_i+μ_i)+d_i(d_i+1)λ_iμ_i\right)^{1/(d_i+1)}$,这证明了我们对双重正色配分函数多维推广的猜想。我们两个定理的关键技术步骤是通过在 Gemini Deep Think 上构建的定制数学研究代理获得的,这可以看作是当前最先进的语言模型在部分数学研究中协助的基准测试。
英文摘要:
In statistical physics, the multivariate hard-core model describes a system of particles, each of which receives its own fugacity. In graph-theoretic language, the partition function of the model translates to the multivariate independence polynomial, i.e., the multiaffine generalisation of the independence polynomial, defined by $Z_G(λ_1,\dots,λ_n) := \sum_{I\in\mathcal{I}(G)} \prod_{v\in I}λ_v$, where $\mathcal{I}(G)$ denotes the set of all independent sets in a graph $G$ on $[n]:=\{1,2,\dots,n\}$. We prove that for every simple graph $G$ on $[n]$ and $λ_1,\dots,λ_n\geq 0$, \[ Z_G(λ_1,\dots,λ_n) \geq \prod_{i=1}^n (1+(d_i+1)λ_i)^{1/(d_i+1)}, \] where $d_1,\dots,d_n$ is the degree sequence of $G$. This generalises a result of Sah, Sawhney, Stoner, and Zhao, who proved the univariate case $λ_1=\dots=λ_n=λ$. We further conjecture that our inequality should generalise to other antiferromagnetic models and give some evidence in support of it. In particular, for $λ_i,μ_i\geq 0$, $1\leq i\leq n$, we obtain a stronger inequality \[ \sum_{\substack{I,J\in \mathcal{I}(G) \\ I\cap J=\emptyset}} \prod_{v\in I}λ_v\prod_{u\in J}μ_u \geq \prod_{i=1}^n \left(1+(d_i+1)(λ_i+μ_i)+d_i(d_i+1)λ_iμ_i\right)^{1/(d_i+1)}, \] which proves our conjecture for a multiaffine generalisation of the semiproper colouring partition function with two proper colours. Our key technical steps for both theorems are obtained by using a custom mathematical research agent built on top of Gemini Deep Think, which can be seen as a benchmark demonstrating that the current state-of-the-art language models can, in part, assist with mathematical research.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。