99/3 |
"The Deconfinement Phase Transition in One-Flavour QCD," C. Alexandrou, A. Boriçi, A. Feo, P. de Forcrand, A. Galli, F. Jegerlehner, and T. Takaishi, University of Minnesota Supercomputing Institute Research Report UMSI 99/3, January 1999. Submitted for publication. |
These researchers studied the deconfinement phase transition of one-flavor Quantum Chromodynamics (QCD) using the multiboson algorithm. The mass of the Wilson fermions relevant for this study is moderately large, and the non-hermitian multiboson method is a superior simulation algorithm. Finite size scaling is studied on lattices of size 83 x 4, 123 x 4, and 163 x 4. The behaviors of the peak of the Polyakov loop susceptibility, the deconfinement ratio, and the distribution of the norm of the Polyakov loop are all characteristic of a first-order phase transition for heavy quarks. As the quark mass decreases, the first-order transition gets weaker and turns into a crossover. To investigate finite size scaling on larger spatial lattices, these researchers use an effective action in the same universality class as QCD. This effective action is constructed by replacing the fermionic determinant with the Polyakov loop identified as the most relevant Z(3) symmetry breaking term. Higher-order effects are incorporated in an effective Z(3)-breaking field, h, which couples to the Polyakov loop. Finite size scaling determines the value of h where the first order transition ends. This analysis, at the endpoint hep, indicates that the effective model and QCD are consistent with the universality class of the three-dimensional Ising model. Matching the field strength at the end point hep to the k values used in the dynamical quark simulations, the group estimated the endpoint kep of the first-order phase transition. They found kep ~ 0.08, which corresponds to a quark mass of about 1.4 GeV.
|
|
URL: http://www.msi.umn.edu/about/publications/annualreport/ar2000/depts/IT/PhysAstron/Theoretical_Physics/de_forcrand.html |
|
| This page last modified on Friday, 30-May-2008 16:14:07 CDT | ||
| Please direct questions or problems to help@msi.umn.edu | ||
|
Website related questions or problems should be directed to
webmaster@msi.umn.edu
The Supercomputing Institute does not collect personal information on visitors to our website. For the University of Minnesota policy, see www.privacy.umn.edu. © 2001 by the Regents of the University of Minnesota |
||