2000 character limit reached
Hernandez-Leclerc modules and snake graphs (2009.09461v3)
Published 20 Sep 2020 in math.QA and math.CO
Abstract: In 2010, Hernandez and Leclerc studied connections between representations of quantum affine algebras and cluster algebras. In 2019, Brito and Chari defined a family of modules over quantum affine algebras, called Hernandez-Leclerc modules. We characterize the highest $\ell$-weight monomials of Hernandez-Leclerc modules. We give a non-recursive formula for $q$-characters of Hernandez-Leclerc modules using snake graphs, which involves an explicit formula for $F$-polynomials. We also give a new recursive formula for $q$-characters of Hernandez-Leclerc modules.
Sponsor
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.