Partition functions and graphs: A combinatorial approach

Solomon, A. I.; Blasiak, P.; Duchamp, G. E. H.; Horzela, A. and Penson, K. A. (2004). Partition functions and graphs: A combinatorial approach. In: Proceedings of the XI International Conference on Symmetry Methods in Physics (SYMPHYS-11), 21-24 Jun 2004, Prague.



Although symmetry methods and analysis are a necessary ingredient in every physicist's toolkit, rather less use has been made of combinatorial methods. One exception is in the realm of Statistical Physics, where the calculation of the partition function, for example, is essentially a combinatorial problem. In this talk we shall show that one approach is via the normal ordering of the second quantized operators appearing in the partition function. This in turn leads to a combinatorial graphical description, giving essentially Feynman{type graphs associated with the theory. We illustrate this methodology by the explicit calculation of two model examples, the free boson gas and a super uid boson model. We show how the calculation of partition functions can be facilitated by knowledge of the combinatorics of the boson normal ordering problem; this naturally gives rise to the Bell numbers of combinatorics. The associated graphical representation of these numbers gives a perturbation expansion in terms of a sequence of graphs analogous to zero{dimensional Feynman diagrams. [brace not closed]

Viewing alternatives

Download history

Item Actions