On Solvable Lattice Models and Knot Invariants

Physics – High Energy Physics – High Energy Physics - Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

11 pages, Caltech preprint, May, 1993, phyzzx macropackage

Scientific paper

Recently, a class of solvable interaction round the face lattice models (IRF) were constructed for an arbitrary rational conformal field theory (RCFT) and an arbitrary field in it. The Boltzmann weights of the lattice models are related in the extreme ultra violet limit to the braiding matrices of the rational conformal field theory. In this note we use these new lattice models to construct a link invariant for any such pair of an RCFT and a field in it. Using the properties of RCFT and the IRF lattice models, we prove that the invariants so constructed always obey the Markov properties, and thus are true link invariants. Further, all the known link invariants, such as the Jones, HOMFLY and Kauffman polynomials arise in this way, along with giving a host of new invariants, and thus also a unified approach to link polynomials. It is speculated that all link invariants arise from some RCFT, and thus the problem of classifying link and knot invariants is equivalent to that of classifying two dimensional conformal field theory.

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

On Solvable Lattice Models and Knot Invariants 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 On Solvable Lattice Models and Knot Invariants, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Solvable Lattice Models and Knot Invariants will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-549995

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