The Potts model and the Tutte polynomial

DOI10.1063/1.533181zbMath1045.82501WikidataQ60265212 ScholiaQ60265212MaRDI QIDQ2737867

No author found.

Publication date: 30 August 2001

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

Full work available at URL: https://doi.org/10.1063/1.533181

Mathematics Subject Classification ID

82B20: Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics

Related Items

First-order phase transition in Potts models with finite-range interactions, Spanning forests and the \(q\)-state Potts model in the limit \(q \to 0\), The chip-firing game

Cites Work

• Unnamed Item
• The limit of chromatic polynomials
• Chip-firing games on graphs
• Random generation of combinatorial structures from a uniform distribution
• A spanning tree expansion of the Jones polynomial
• A combinatorial series expansion for the Ising model
• The polytope of win vectors
• Forests, colorings and acyclic orientations of the square lattice
• Chip firing and the Tutte polynomial
• An algorithm for the Tutte polynomials of graphs of bounded treewidth
• Approximations for chromatic polynomials
• The random-cluster model on the complete graph
• On the number of Eulerian orientations of a graph
• A new subgraph expansion for obtaining coloring polynomials for graphs
• Acyclic orientations of graphs
• The statistics of dimers on a lattice
• Self-organized criticality
• Polynomial-Time Approximation Algorithms for the Ising Model
• On the Number of Distinct Forests
• Graph minors. II. Algorithmic aspects of tree-width
• Weight Enumeration and the Geometry of Linear Codes
• Colouring Square Lattice Graphs
• MULTIDIMENSIONAL LATTICES AND THEIR PARTITION FUNCTIONS
• On the Principal Edge Tripartition of a Graph
• The Rank Polynomials of Large Random Lattices
• Evaluating the Tutte Polynomial for Graphs of Bounded Tree-Width
• Decompositions of Rational Convex Polytopes
• The Computational Complexity of the Tutte Plane: the Bipartite Case
• Randomised Approximation in the Tutte Plane
• A Randomised Approximation Algorithm for Counting the Number of Forests in Dense Graphs
• Self-organized critical state of sandpile automaton models
• On the computational complexity of the Jones and Tutte polynomials
• Polynomial time randomized approximation schemes for Tutte–Gröthendieck invariants: The dense case
• On dichromatic polynomials
• BEHAVIOR IN LARGE DIMENSIONS OF THE POTTS AND HEISENBERG MODELS