Enumerative problems inspired by Mayer's theory of cluster integrals

MaRDI QIDQ1883644zbMATH OpenFDO

Authors Pierre Leroux

Publication date 13 October 2004

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

Full work available at URL https://arxiv.org/abs/math/0401001, https://eudml.org/doc/124093, http://www.emis.de/journals/EJC/Volume_11/Abstracts/v11i1r32.html

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

zbMATH Keywords

enumerationHusimi graphs

Mathematics Subject Classification ID

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

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.

Review text

Summary: The basic functional equations for connected and 2-connected 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 first review these functional equations, putting the emphasis on the structural relationships between the various classes of graphs. We then investigate the problem of enumerating some class of connected graphs all of whose 2-connected components (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 address the question of their labelled and unlabelled enumeration, according (or not) to their block-size distributions. Finally we discuss the molecular expansion of these species. It consists of a descriptive classification of the unlabelled structures in terms of elementary species, from which all their symmetries can be deduced.

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

Cited in

(24)

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

Describes a project that uses

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)