Reflection positivity, rank connectivity, and homomorphism of graphs

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

It 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.
17 pages Latex

Keywords

Combinatorics, Mathematical Physics, 05C99 (Primary), 82B99 (Secondary)

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/70974

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0404468
 http://arxiv.org/abs/math/0404468

Collections

arXiv