ABSTRACT
We considerably simplify Kaufman's solution of the two-dimensional Ising model by introducing two commuting representations of the complex rotation group SO(2n,C). All eigenvalues of the transfer matrix and therefore the partition function are found in a straightforward way.
ABSTRACT
The free energy of a field theory can be considered as a functional of the free correlation function. As such it obeys a nonlinear functional differential equation that can be turned into a recursion relation. This is solved order by order in the coupling constant to find all connected vacuum diagrams with their proper multiplicities. The procedure is applied to a multicomponent scalar field theory with a straight phi(4) self-interaction and then to a theory of two scalar fields straight phi and A with an interaction straight phi2A. All Feynman diagrams with external lines are obtained from functional derivatives of the connected vacuum diagrams with respect to the free correlation function. Finally, the recursive graphical construction is automatized by computer algebra with the help of a unique matrix notation for the Feynman diagrams.
ABSTRACT
The free energy of a multicomponent scalar field theory is considered as a functional W[G,J] of the free correlation function G and an external current J. It obeys nonlinear functional differential equations which are turned into recursion relations for the connected Green's functions in a loop expansion. These relations amount to a simple proof that W[G,J] generates only connected graphs and can be used to find all such graphs with their combinatoric weights. A Legendre transformation with respect to the external current converts the functional differential equations for the free energy into those for the effective energy Gamma[G,Phi], which is considered as a functional of the free correlation function G and the field expectation Phi. These equations are turned into recursion relations for the one-particle irreducible Green's functions. These relations amount to a simple proof that Gamma[G,J] generates only one-particle irreducible graphs and can be used to find all such graphs with their combinatoric weights. The techniques used also allow for a systematic investigation into resummations of classes of graphs. Examples are given for resumming one-loop and multiloop tadpoles, both through all orders of perturbation theory. Since the functional differential equations derived are nonperturbative, they constitute also a convenient starting point for other expansions than those in numbers of loops or powers of coupling constants. We work with general interactions through four powers in the field.