边反射正性与加权图同态
Edge-reflection positivity and weighted graph homomorphisms
摘要:
B. Szegedy [边着色模型和反射正性,{ \sl美国数学学会杂志} { \bf 20}(2007)969--988]表明加权图中的同态数量等于复杂边着色模型的分拆函数。利用几何不变量理论中的一些结果,我们刻画了哪些加权图的边着色模型是实值的,也就是说,我们刻画了哪些加权图的同态数是边反射正的。特别是,我们明确确定的单图的同态到他们的数量等于一个真正的边着色模型的分拆函数。这回答了Szegedy提出的一个问题。
英文摘要:
B. Szegedy [Edge coloring models and reflection positivity, {\sl Journal of the American Mathematical Society} {\bf 20} (2007) 969--988] showed that the number of homomorphisms into a weighted graph is equal to the partition function of a complex edge-coloring model. Using some results in geometric invariant theory, we characterize for which weighted graphs the edge-coloring model can be taken to be real valued that is, we characterize for which weighted graphs the number of homomorphisms into them are edge-reflection positive. In particular, we determine explicitly for which simple graphs the number of homomorphisms into them is equal to the partition function of a real edge-coloring model. This answers a question posed by Szegedy.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。