Fused Potts Models

Physics – High Energy Physics – High Energy Physics - Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

60 pages and 39 figures, uuencoded, tar, compressed Latex files, YCTP-P44-92,USC-93-013

Scientific paper

10.1142/S0217751X93002071

Generalizing the mapping between the Potts model with nearest neighbor interaction and six vertex model, we build a family of "fused Potts models" related to the spin $k/2$ ${\rm U}_{q}{\rm su}(2)$ invariant vertex model and quantum spin chain. These Potts model have still variables taking values $1,\ldots,Q$ ($\sqrt{Q}=q+q^{-1}$) but they have a set of complicated multi spin interactions. The general technique to compute these interactions, the resulting lattice geometry, symmetries, and the detailed examples of $k=2,3$ are given. For $Q>4$ spontaneous magnetizations are computed on the integrable first order phase transition line, generalizing Baxter's results for $k=1$. For $Q\leq 4$, we discuss the full phase diagram of the spin one ($k=2$) anisotropic and ${\rm U}_{q}{\rm su}(2)$ invariant quantum spin chain (it reduces in the limit $Q=4$ ($q=1$) to the much studied phase diagram of the isotropic spin one quantum chain). Several critical lines and massless phases are exhibited. The appropriate generalization of the Valence Bond State method of Affleck et al. is worked out.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Fused Potts Models does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Fused Potts Models, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fused Potts Models will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-188529

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.