The Potts model and the Tutte polynomial

DOI10.1063/1.533181zbMath1045.82501OpenAlexW1971911032WikidataQ60265212 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

Related Items (45)

Computing the Tutte polynomial of Archimedean tilings ⋮ Counting coloured planar maps: differential equations ⋮ Bigraphical arrangements ⋮ Tutte polynomial of scale-free networks ⋮ Parallel family trees for transfer matrices in the Potts model ⋮ The Tutte polynomial of an infinite family of outerplanar, small-world and self-similar graphs ⋮ First-order phase transition in Potts models with finite-range interactions ⋮ Fourientation activities and the Tutte polynomial ⋮ Fourientations and the Tutte polynomial ⋮ Tutte polynomial of pseudofractal scale-free web ⋮ Tutte polynomials for regular oriented matroids ⋮ Tutte and Jones polynomials of links, polyominoes and graphical recombination patterns ⋮ The Tutte polynomial of symmetric hyperplane arrangements ⋮ Characterizing partition functions of the vertex model ⋮ On the Potts model partition function in an external field ⋮ Models of random subtrees of a graph ⋮ What is a random surface? ⋮ The Tutte polynomial of some matroids ⋮ Fixing balanced knockout and double elimination tournaments ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Subset Glauber dynamics on graphs, hypergraphs and matroids of bounded tree-width ⋮ Graph polynomials and link invariants as positive type functions on Thompson’s group F ⋮ Tutte polynomials of two self-similar network models ⋮ Tutte polynomial of the Apollonian network ⋮ Spanning forests in regular planar maps ⋮ Novel quantum phases on graphs using abelian gauge theory ⋮ Even subgraph expansions for the flow polynomial of planar graphs with maximum degree at most 4 ⋮ A NOTE ON THE TUTTE POLYNOMIAL AND THE AUTOMORPHISM GROUP OF A GRAPH ⋮ The Jones polynomial and functions of positive type on the oriented Jones-Thompson groups \(\vec{F}\) and \(\vec{T} \) ⋮ A little statistical mechanics for the graph theorist ⋮ A note on recognizing an old friend in a new place: list coloring and the zero-temperature Potts model ⋮ Counting colored planar maps: algebraicity results ⋮ The Tutte-Potts connection in the presence of an external magnetic field ⋮ Higher matrix-tree theorems and Bernardi polynomial ⋮ Tutte polynomials for directed graphs ⋮ The behavior of Tutte polynomials of graphs under five graph operations and its applications ⋮ Characterizing partition functions of the spin model by rank growth ⋮ Stable Matching with Uncertain Linear Preferences ⋮ Stable matching with uncertain linear preferences ⋮ Asymptotic behavior of acyclic and cyclic orientations of directed lattice graphs ⋮ Study of exponential growth constants of directed heteropolygonal Archimedean lattices ⋮ Spanning forests and the \(q\)-state Potts model in the limit \(q \to 0\) ⋮ The chip-firing game ⋮ Flag matroids: algebra and geometry

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

This page was built for publication: The Potts model and the Tutte polynomial