The minimal monomial lfting of cluster algebras I: branching problems
Abstract
Let G ⊂eq G be complex reductive algebraic groups. The branching problem that aims to study G-modules as G-modules is encoded by a collection of branching multiplicities parameterised by pairs of dominant weights. The branching algebra Br(G, G) is a graded algebra whose dimension of homogeneous components are precisely the branching multiplicities. Here, we endow Br(G, G) with the structure of a graded upper cluster algebra, for some pair of groups. Our result holds if G is a Levi subgroup of G or in the tensor product case, that is when G is the diagonal in G= G × G, assuming that G is semisimple and simply connected. This sharpens J.Fei's result who got the same statement for G=T a maximal torus of G and for G ⊂eq G × G, assuming G simple, simply laced and simply connected. To prove our result we develop a new geometric and compbinatorial technique called minimal monomial lifting. Let Y be a complex scheme with cluster structure, T be a complex torus and X be a suitable partial compactification of T × Y. The minimal monomial lifting produces a canonically graded upper cluster algebra A inside OX(X) which is, in a precise sense, the best candidate to give a cluster structure on X compatible with the one on Y. We develop some geometric criteria to prove the equality between A and OX(X), which doesn't always hold and has some remarkable consequences. This technique is very flexible and will be used elsewhere to endow other classical algebras with the structure of a graded upper cluster algebra.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.