Papers
Topics
Authors
Recent
Search
2000 character limit reached

On polyhedral formula for Kirillov-Reshetikhin modules

Published 1 Jan 2019 in math.RT and math.QA | (1901.00104v1)

Abstract: We propose a method to prove a polyhedral branching formula for Kirillov-Reshetikhin modules over a quantum affine algebra. When the underlying simple Lie algebra is of exceptional type, such a formula remains mostly conjectural. We convert a polyhedral formula into an identity between two rational functions of a single variable with only simple poles at known locations. It is then sufficient to check the equalities of the residues at those poles, which are explicitly computable quantities. By following this strategy, we obtain a computer-assisted proof of a conjectural polyhedral formula in type $F_4$.

Authors (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.