CLUSTEREASY: A Program for Simulating Scalar Field Evolution on Parallel Computers

We describe a new, parallel programming version of the scalar field simulation program LATTICEEASY. The new C++ program, CLUSTEREASY, can simulate arbitrary scalar field models on distributed-memory clusters. The speed and memory requirements scale well with the number of processors. As with the serial version of LATTICEEASY, CLUSTEREASY can run simulations in one, two, or three dimensions, with or without expansion of the universe, with customizable parameters and output. The program and its full documentation are available on the LATTICEEASY website at http://www.science.smith.edu/departments/Physics/fstaff/gfelder/latticeeasy/. In this paper we provide a brief overview of what CLUSTEREASY does and the ways in which it does and doesn't differ from the serial version of LATTICEEASY.Comment: 3 pages, 1 figur

Resonance Relations for Solutions of the Elliptic QKZB Equations, Fusion Rules, and Eigenvectors of Transfer Matrices of Restricted Interaction-round-a-face Models

Conformal blocks for the WZW model on tori can be represented by vector valued Weyl anti-symmetric theta functions on the Cartan subalgebra satisfying vanishing conditions on root hyperplanes. We introduce a quantum version of these vanishing conditions in the sl(2) case. They are compatible with the qKZB equations and are obeyed by the hypergeometric solutions as well as by their critical level counterpart, which are Bethe eigenfunctions of IRF row-to-row transfer matrices. In the language of IRF models the vanishing conditions turn out to be equivalent to the sl(2) fusion rules defining restricted models.Comment: 64 pages, late