Distance-regular graphs and the quantum affine algebra Uq(bsl2)
author:
Paul Terwilliger,
University of Wisconsin - Madison
Description
Combinatorial objects, such as graphs, can often be used to construct
representations of abstract algebras. In this talk we will consider a
graph possessing a high degree of regularity, known as a
distance-regularity. For this graph we define an algebra generated by
the adjacency matrix and a certain diagonal matrix. There exists a set
of elements in this algebra that, under a minor assumption, satisfy
some attractive relations. Using these relations we obtain a
representation of the quantum affine sl2 algebra.
You might be experiencing some problems with Your Video player.
Lecture rating
| People found this lecture: | ||
| Worth seeing | ||
| because it is: | ||
| Valuable and informative | ||
| Well presented | ||
| Easily understandable | ||
| Acceptably recorded | ||
| You need to login to cast your vote. | ||
Report a problem or upload files
If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Related content
Visitors who watched this lecture also watched...
Link this page
Would you like to put a link to this lecture on your homepage?Go ahead! Copy the HTML snippet !





