An algorithm for Berenstein-Kazhdan decoration functions and trails for minuscule representations
Yuki Kanakubo, Gleb Koshevoy, Toshiki Nakashima

TL;DR
This paper presents an explicit algorithm to compute Berenstein-Kazhdan decoration functions and trails for minuscule representations, providing a combinatorial tool that resembles crystal graphs, applicable to various types including A_n and G_2.
Contribution
The paper introduces a novel algorithm for explicit computation of decoration functions in minuscule representations, extending to non-minuscule cases like G_2.
Findings
The algorithm effectively computes decoration graphs for minuscule representations.
It generalizes to all i in type A_n and works for some non-minuscule cases like G_2.
The decoration graph shares properties with crystal graphs of minuscule representations.
Abstract
For a simply connected connected simple algebraic group , a cell is a geometric crystal with a positive structure . Applying the tropicalization functor to a rational function called the half decoration on , one can realize the crystal in . By computing , we get an explicit form of in . In this paper, we give an algorithm to compute explicitly for such that is a minuscule representation of . In particular, the algorithm works for all if is of type . The algorithm computes a…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAlgebraic structures and combinatorial models · Advanced Algebra and Geometry · Advanced Combinatorial Mathematics
