arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1802.06103cs.CCcs.DM
收藏

模素树的同态计数

Counting Homomorphisms to Trees Modulo a Prime

Andreas Göbel, J. A. Gregor Lagodzinski, Karen Seidel

摘要:

许多重要的图论概念可以编码为计数图同态问题,例如统计物理中的配分函数,特别是独立集和着色。在这篇文章中,我们研究了$\#_p\mathsf{H}$ OMS $\mathsf{T}$ O $H$的复杂性,从输入图到图$H$模素数$p$的图同态计数问题。Dyer和Greenhill证明了一个二分法,说明非模计数图同态的易处理性取决于输入图的结构。由于取消现象的普遍存在,非模计数中许多难以处理的情况在模计数中变得容易处理。然而,在随后的研究计数模$2$的影响,结构的$H$上的易处理性,被证明是持久的,产生类似的二分法。我们的主要结果表明,对于每一棵树$H$和每一个素数$p$,问题$\#_p\mathsf{H}$ OMS $\mathsf{T}$ O $H$是多项式时间可计算的或$\#_p\mathsf{P}$ -完全的.这解决了Faben和Jerrum在模2计数时对每个图$H$陈述这种二分法的猜想。为了证明这个结果,我们研究了同态的结构性质。作为一个重要的过渡,这项研究产生了一个二分法的问题的加权计数独立集的二分图模一些素数$p$。我们的结果是第一次表明,这样的二分法不仅适用于1位功能的模~2的情况下,但所有素数$p$的模计数功能。

英文摘要:

Many important graph theoretic notions can be encoded as counting graph homomorphism problems, such as partition functions in statistical physics, in particular, independent sets and colourings. In this article we study the complexity of $\#_p\mathsf{H}$OMS$\mathsf{T}$O$H$, the problem of counting graph homomorphisms from an input graph to a graph $H$ modulo a prime number $p$. Dyer and Greenhill proved a dichotomy stating that the tractability of non-modular counting graph homomorphisms depends on the structure of the input graph. Many intractable cases in non-modular counting become tractable in modular counting due to the common phenomenon of cancellation. However, in subsequent studies on counting modulo $2$ the influence, the structure of $H$ has on the tractability, was shown to persist, yielding similar dichotomies. Our main result shows that for every tree $H$ and every prime $p$ the problem $\#_p\mathsf{H}$OMS$\mathsf{T}$O$H$ is either polynomial time computable or $\#_p\mathsf{P}$-complete. This addresses the conjecture of Faben and Jerrum stating this dichotomy for every graph $H$ when counting modulo 2. In order to prove this result, we study the structural properties of a homomorphism. As an important interim, this study yields a dichotomy for the problem of weighted counting independent sets in a bipartite graph modulo some prime $p$. Our results are the first suggesting that such dichotomies hold not only for the one-bit functions of the modulo~2 case but for the modular counting functions of all primes $p$.

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

↑