Reflection positivity, rank connectivity, and homomorphism of graphs

Simple item page
dc.creatorFreedman, M.
dc.creatorLovasz, L.
dc.creatorSchrijver, A.
dc.date2004-04-26
dc.date.accessioned2026-07-07T05:07:44Z
dc.date.available2026-07-07T05:07:44Z
dc.descriptionIt is shown that a graph parameter can be realized as the number of homomorphisms into a fixed (weighted) graph if and only if it satisfies two linear algebraic conditions: reflection positivity and exponential rank-connectivity. In terms of statistical physics, this can be viewed as a characterization of partition functions of vertex models.
dc.description17 pages Latex
dc.identifierhttps://arxiv.org/abs/math/0404468
dc.identifierhttp://arxiv.org/abs/math/0404468
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/70974
dc.subjectCombinatorics
dc.subjectMathematical Physics
dc.subject05C99 (Primary), 82B99 (Secondary)
dc.titleReflection positivity, rank connectivity, and homomorphism of graphs
dc.typetext

Files

Collections

arXiv