arXiv Analytics

Sign in

arXiv:1211.3561 [math.CO]AbstractReferencesReviewsResources

Characterizing partition functions of the edge-coloring model by rank growth

Alexander Schrijver

Published 2012-11-15, updated 2015-06-24Version 2

We characterize which graph invariants are partition functions of an edge-coloring model over the complex numbers, in terms of the rank growth of associated `connection matrices'.

Categories: math.CO, math-ph, math.MP
Subjects: 05C31, 82B05, 20C30
Related articles: Most relevant | Search more
arXiv:1209.5044 [math.CO] (Published 2012-09-23)
Characterizing partition functions of the spin model by rank growth
arXiv:1102.4985 [math.CO] (Published 2011-02-24)
Characterizing partition functions of the vertex model
arXiv:2102.02920 [math.CO] (Published 2021-02-04)
Twenty Vertex model and domino tilings of the Aztec triangle

Links

Toolbox