An algorithm for Berenstein-Kazhdan decoration functions and trails for minuscule representations
An algorithm for Berenstein-Kazhdan decoration functions and trails for minuscule representations
复制标题
Berenstein-Kazhdan 装饰函数和微小表示轨迹的算法
DOI:
10.1016/j.jalgebra.2022.04.042
复制
发表时间:
2022
影响因子:
0.9
通讯作者:
Nakashima T. (with Kanakubo Y. and Koshevoy G.)
中科院分区:
文献类型:
--
作者:
加戸瞭介;武田裕司;梅田聡;Nakashima T. (with Kanakubo Y. and Koshevoy G.)
For a simply connected connected simple algebraic group G, a cell B w 0−= B−∩ U w 0‾ U is a geometric crystal with a positive structure θ i−:(C×) l (w 0)→ B w 0−. Applying the tropicalization functor to a rational function Φ B K h=∑ i∈ I Δ w 0 Λ i, s i Λ i called the half decoration on B w 0−, one can realize the crystal B (∞) in Z l (w 0). By computing Φ B K h, we get an explicit form of B (∞) in Z l (w 0). In this paper, we give an algorithm to compute Δ w 0 Λ i, s i Λ i∘ θ i− explicitly for i∈ I such that V (Λ i) is a minuscule representation of g= Lie (G). In particular, the algorithm works for all i∈ I if g is of type A n. The algorithm computes a directed graph DG, called a decoration graph, whose vertices are labelled by all monomials in Δ w 0 Λ i, s i Λ i∘ θ i−(t 1,⋯, t l (w 0)). The decoration graph has some properties similar to crystal graphs of minuscule representations. We also verify that the algorithm works in some other cases, for example, the case g is of type G 2 though V (Λ i) is non-minuscule.
登录
查看更多内容
影响因子:
1.7
作者:
Volker Genz;G. Koshevoy;Bea Schumann
通讯作者:
Bea Schumann
DOI:
--
发表时间:
1999
期刊:
影响因子:
--
作者:
A. Berenstein;D. Kazhdan
通讯作者:
D. Kazhdan
DOI:
--
发表时间:
2005
期刊:
影响因子:
--
作者:
T. Kobayashi;T. Oshima
通讯作者:
T. Oshima
DOI:
10.1090/conm/433/08321
发表时间:
2006
期刊:
arXiv: Quantum Algebra
影响因子:
--
作者:
A. Berenstein;D. Kazhdan
通讯作者:
D. Kazhdan
DOI:
10.1007/978-3-030-02191-7_8
发表时间:
2018
期刊:
--
影响因子:
--
作者:
A. Joseph
通讯作者:
A. Joseph