Enumerative problems inspired by Mayer's theory of cluster integrals

zbMATH Open1054.05056arXivmath/0401001MaRDI QIDQ1883644FDOQ1883644

Authors: Pierre Leroux 

Publication date: 13 October 2004

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Abstract: The basic functional equations for connected and 2-connnected graphs can be traced back to the statistical physicists Mayer and Husimi. They play an essential role in establishing rigorously the virial expansion for imperfect gases. We survey this approach and inspired by these equations, we investigate the problem of enumerating some classes of connected graphs all of whose blocks are contained in a given class B. Included are the species of Husimi graphs (B = "complete graphs"), cacti (B = "unoriented cycles"), and oriented cacti (B = "oriented cycles"). For each of these, we consider the question of their labelled or unlabelled enumeration and of their molecular expansion, according (or not) to their block-size distributions.

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

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• Solution to a combinatorial puzzle arising from Mayer's theory of cluster integrals
• scientific article; zbMATH DE number 4099342
• A solution to the combinatorial puzzle of Mayer's virial expansion
• Structure and enumeration of two-connected graphs with prescribed three-connected components
• Biconnected graphs and the multivariate virial expansion

zbMATH Keywords

enumerationHusimi graphs

Mathematics Subject Classification ID

Trees (05C05) Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30) Equilibrium statistical mechanics (82B99)

Cited In (22)

• The mathematical life of Pierre Leroux
• Virial inversion and density functionals
• The virial series for a gas of particles with uniformly repulsive pairwise interaction and its relation with the approach to the mean field
• Biconnected graphs and the multivariate virial expansion
• Deformations of the braid arrangement and trees
• Graph weights arising from statistical mechanics
• Convergence of density expansions of correlation functions and the Ornstein-Zernike equation
• Revisiting Groeneveld's approach to the virial expansion
• A solution to the combinatorial puzzle of Mayer's virial expansion
• Title not available (Why is that?)
• The combinatorics behind the leading Kazhdan-Lusztig coefficients of braid matroids
• Mayer weights and Fourier transforms
• Combinatorics and cluster expansions
• An algebraic representation of graphs and applications to graph enumeration
• On sharp transitions in making squares
• Enumeration of labeled block-cactus graphs
• Cluster expansion in the canonical ensemble
• Inductive construction of 2-connected graphs for calculating the virial coefficients
• Enumeration of labeled connected graphs with given order and size
• Solution to a combinatorial puzzle arising from Mayer's theory of cluster integrals
• Running Time Predictions for Factoring Algorithms
• Multispecies virial expansions

Uses Software

• Devmol

This page was built for publication: Enumerative problems inspired by Mayer's theory of cluster integrals

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