Enumerative problems inspired by Mayer's theory of cluster integrals
From MaRDI portal
Publication:1883644
zbMath1054.05056arXivmath/0401001MaRDI QIDQ1883644
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
Trees (05C05) Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30) Equilibrium statistical mechanics (82B99)
Related Items (16)
The mathematical life of Pierre Leroux ⋮ Enumeration of labeled connected graphs with given order and size ⋮ Deformations of the braid arrangement and trees ⋮ Running Time Predictions for Factoring Algorithms ⋮ Graph weights arising from statistical mechanics ⋮ On sharp transitions in making squares ⋮ An algebraic representation of graphs and applications to graph enumeration ⋮ Convergence of density expansions of correlation functions and the Ornstein-Zernike equation ⋮ Cluster expansion in the canonical ensemble ⋮ Multispecies virial expansions ⋮ Mayer weights and Fourier transforms ⋮ A solution to the combinatorial puzzle of Mayer's virial expansion ⋮ Revisiting Groeneveld’s approach to the virial expansion ⋮ Virial inversion and density functionals ⋮ Enumeration of labeled block-cactus graphs ⋮ The virial series for a gas of particles with uniformly repulsive pairwise interaction and its relation with the approach to the mean field
Uses Software
This page was built for publication: Enumerative problems inspired by Mayer's theory of cluster integrals
