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

DOI10.1016/J.JCTA.2015.06.007MaRDI QIDQ490913zbMATH OpenOpenAlexFDO

Authors Alexander Schrijver

Publication date 21 August 2015

Published in Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1211.3561

zbMATH Keywords

partition functionrepresentation theorysymmetric groupgraph parametersedge-coloring modelconnection matrix

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Symmetric groups (20B30)

Abstract: 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'.

Recommendations

• A characterization of edge-reflection positive partition functions of vertex-coloring models
• Mixed partition functions and exponentially bounded edge-connection rank
• Characterizing partition functions of the spin model by rank growth
• Characterising random partitions by random colouring
• Partition functions and a generalized coloring-flow duality for embedded graphs
• Partitions and edge colourings of multigraphs
• The Edge Partition Dimension of Graphs
• The rank-width of edge-coloured graphs
• Vertex partitions of \(r\)-edge-colored graphs
• Colour-independent partition functions in coloured vertex models

Cites work

• scientific article; zbMATH DE number 3771876 (Why is no real title available?)
• Characterizing partition functions of the vertex model
• Edge coloring models and reflection positivity
• Graph invariants in the spin model
• Graph invariants related to statistical mechanical models: Examples and problems
• Group theory. Birdtracks, Lie's, and exceptional groups
• Holographic algorithms by Fibonacci gates
• Reflection positivity, rank connectivity, and homomorphism of graphs

Cited in

(6)

• Characterizing partition functions of the spin model by rank growth
• Edge distribution and density in the characteristic sequence
• Graph parameters from symplectic group invariants
• Mixed partition functions and exponentially bounded edge-connection rank
• Partition functions from orthogonal and symplectic group invariants
• Perfect matchings, rank of connection tensors and graph homomorphisms

This page was built for publication: Characterizing partition functions of the edge-coloring model by rank growth

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q490913)