Boundary chromatic polynomial

DOI10.1007/S10955-008-9585-0zbMATH Open1151.82322arXiv0803.2665OpenAlexW1972613426WikidataQ58082364 ScholiaQ58082364MaRDI QIDQ960129FDOQ960129

Authors: Jesper Lykke Jacobsen, H. Saleur 

Publication date: 16 December 2008

Published in: Journal of Statistical Physics (Search for Journal in Brave)

Abstract: We consider proper colorings of planar graphs embedded in the annulus, such that vertices on one rim can take Q_s colors, while all remaining vertices can take Q colors. The corresponding chromatic polynomial is related to the partition function of a boundary loop model. Using results for the latter, the phase diagram of the coloring problem (with real Q and Q_s) is inferred, in the limits of two-dimensional or quasi one-dimensional infinite graphs. We find in particular that the special role played by Beraha numbers Q=4 cos^2(pi/n) for the usual chromatic polynomial does not extend to the case Q different from Q_s. The agreement with (scarce) existing numerical results is perfect; further numerical checks are presented here.

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

Recommendations

• Zeroes of chromatic polynomials: A new approach to Beraha conjecture using quantum groups
• Chromatic polynomials for lattice strips with cyclic boundary conditions
• Transfer matrices and partition-function zeros for antiferromagnetic Potts models. I: General theory and square-lattice chromatic polynomial.
• Transfer matrices and partition-function zeros for antiferromagnetic Potts models. III: Triangular-lattice chromatic polynomial
• Transfer matrices and partition-function zeros for antiferromagnetic Potts models. IV. Chromatic polynomial with cyclic boundary conditions

zbMATH Keywords

chromatic polynomialTemperley-Lieb algebragraph coloringsboundary loop model

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20)

Cites Work

• Statistical Theory of Equations of State and Phase Transitions. I. Theory of Condensation
• Limits of zeroes of recursively defined polynomials
• The antiferromagnetic transition for the square-lattice Potts model
• Transfer matrices and partition-function zeros for antiferromagnetic Potts models. III: Triangular-lattice chromatic polynomial
• Phase diagram of the chromatic polynomial on a torus
• Transfer matrices and partition-function zeros for antiferromagnetic Potts models. IV. Chromatic polynomial with cyclic boundary conditions
• Transfer matrices and partition-function zeros for antiferromagnetic Potts models. I: General theory and square-lattice chromatic polynomial.
• Conformal boundary loop models
• Chromatic polynomials of large triangular lattices
• PARTITION FUNCTION ZEROS OF A RESTRICTED POTTS MODEL ON SELF-DUAL STRIPS OF THE SQUARE LATTICE
• Zeroes of chromatic polynomials: A new approach to Beraha conjecture using quantum groups

Cited In (8)

• Properties of coloring the annular region
• A note on recognizing an old friend in a new place: list coloring and the zero-temperature Potts model
• Edge states and conformal boundary conditions in super spin chains and super sigma models
• A generalized Beraha conjecture for non-planar graphs
• Weighted graph colorings
• Weighted-set graph colorings
• Transfer matrices and partition-function zeros for antiferromagnetic Potts models. VI. Square lattice with extra-vertex boundary conditions
• Phase diagram of the triangular-lattice Potts antiferromagnet

This page was built for publication: Boundary chromatic polynomial

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