Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userHernandez-Leclerc modules and snake graphs
165
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic 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.
rate research
Read More
Let $mathscr{C}$ be the category of finite dimensional modules over the quantum affine algebra $U_q(widehat{mathfrak{g}})$ of a simple complex Lie algebra ${mathfrak{g}}$. Let $mathscr{C}^-$ be the subcategory introduced by Hernandez and Leclerc. We prove the geometric $q$-character formula conjectured by Hernandez and Leclerc in types $mathbb{A}$ and $mathbb{B}$ for a class of simple modules called snake modules introduced by Mukhin and Young. Moreover, we give a combinatorial formula for the $F$-polynomial of the generic kernel associated to the snake module. As an application, we show that snake modules correspond to cluster monomials with square free denominators and we show that snake modules are real modules. We also show that the cluster algebras of the category $mathscr{C}_1$ are factorial for Dynkin types $mathbb{A,D,E}$.
This paper studies classical weight modules over the $imath$quantum group $mathbf{U}^{imath}$ of type AI. We introduce the notion of based $mathbf{U}^{imath}$-modules by generalizing the notion of based modules over the quantum groups. We prove that each finite-dimensional irreducible classical weight $mathbf{U}^{imath}$-module with integer highest weight is a based $mathbf{U}^{imath}$-module. As a byproduct, a new combinatorial formula for the branching rule from $mathfrak{sl}_n$ to $mathfrak{so}_n$ is obtained.
The aim of the article is to understand the combinatorics of snake graphs by means of linear algebra. In particular, we apply Kasteleyns and Temperley--Fishers ideas about spectral properties of weighted adjacency matrices of planar bipartite graphs to snake graphs. First we focus on snake graphs whose set of turning vertices is monochromatic. We provide recursive sequences to compute the characteristic polynomials; they are indexed by the upper or the lower boundary of the graph and are determined by a neighbour count. As an application, we compute the characteristic polynomials for L-shaped snake graphs and staircases in terms of Fibonacci product polynomials. Next, we introduce a method to compute the characteristic polynomials as convergents of continued fractions. Finally, we show how to transform a snake graph with turning vertices of two colours into a graph with the same number of perfect matchings to which we can apply the results above.
Let O be a topological (colored) operad. The Lurie infinity-category of O-algebras with values in (infinity-category of) complexes is compared to the infinity-category underlying the model category of (classical) dg O-algebras. This can be interpreted as a rectification result for Lurie operad algebras. A similar result is obtained for modules over operad algebras, as well as for algebras over topological PROPs.
We develop a theory of toroidal vertex algebras and their modules, and we give a conceptual construction of toroidal vertex algebras and their modules. As an application, we associate toroidal vertex algebras and their modules to toroidal Lie algebras.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
