tensor product multiplicities via upper cluster algebras
play

Tensor Product Multiplicities via Upper Cluster Algebras Jiarui Fei - PowerPoint PPT Presentation

Tensor Product Multiplicities via Upper Cluster Algebras Jiarui Fei Shanghai Jiao Tong University June 4, 2018 Tensor Product Multiplicities Let G be the connected, simply connected complex algebraic group of type Q . Let V ( ) be the


  1. Tensor Product Multiplicities via Upper Cluster Algebras Jiarui Fei Shanghai Jiao Tong University June 4, 2018

  2. Tensor Product Multiplicities Let G be the connected, simply connected complex algebraic group of type Q . Let V ( λ ) be the irreducible (finite-dimensional) representations of G of highest weight λ . The tensor product of two irreducible representations decomposes as � c λ V ( µ ) ⊗ V ( ν ) = µ,ν V ( λ ) . λ ∈ P + To compute the multiplicity c λ µ,ν is not easy.

  3. The Algebra of Triple-tensor Invariants We consider the algebra of triple-tensor invariants A G := ( k [ G ] U − ⊗ k [ G ] U − ⊗ k [ G ] U ) G . The algebra is multigraded by a triple of dominant weights ( µ, ν, λ ) � C λ µ,ν , λ,µ,ν ∈ P + with the C -dimension of graded component C λ µ,ν equal to c λ µ,ν . It turns out that the algebra A G is an upper cluster algebra!

  4. The Algebra of Triple-tensor Invariants We consider the algebra of triple-tensor invariants A G := ( k [ G ] U − ⊗ k [ G ] U − ⊗ k [ G ] U ) G . The algebra is multigraded by a triple of dominant weights ( µ, ν, λ ) � C λ µ,ν , λ,µ,ν ∈ P + with the C -dimension of graded component C λ µ,ν equal to c λ µ,ν . It turns out that the algebra A G is an upper cluster algebra!

  5. The Quiver ∆ 2 Q The data needed to define an upper cluster algebra is a seed (same as the cluster algebra). The ice quiver ∆ 2 Q in the initial seed can be constructed from the certain category related to Q (ADE quiver). ◮ The vertices of ∆ 2 Q are indecomposable projective presentations P + → P − ; ◮ The arrows of ∆ 2 Q are irreducible morphisms and the AR-translations; Id ◮ The frozen vertices are 0 → P i , P i → 0, and P i − → P i . Theorem (Fei) The algebra A G is an upper cluster algebra C (∆ 2 Q ) .

  6. The Quiver ∆ 2 Q The data needed to define an upper cluster algebra is a seed (same as the cluster algebra). The ice quiver ∆ 2 Q in the initial seed can be constructed from the certain category related to Q (ADE quiver). ◮ The vertices of ∆ 2 Q are indecomposable projective presentations P + → P − ; ◮ The arrows of ∆ 2 Q are irreducible morphisms and the AR-translations; Id ◮ The frozen vertices are 0 → P i , P i → 0, and P i − → P i . Theorem (Fei) The algebra A G is an upper cluster algebra C (∆ 2 Q ) .

  7. The Quiver ∆ 2 Q The data needed to define an upper cluster algebra is a seed (same as the cluster algebra). The ice quiver ∆ 2 Q in the initial seed can be constructed from the certain category related to Q (ADE quiver). ◮ The vertices of ∆ 2 Q are indecomposable projective presentations P + → P − ; ◮ The arrows of ∆ 2 Q are irreducible morphisms and the AR-translations; Id ◮ The frozen vertices are 0 → P i , P i → 0, and P i − → P i . Theorem (Fei) The algebra A G is an upper cluster algebra C (∆ 2 Q ) .

  8. � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � iARt A 4 1 , 0 0 , 4 2 , 0 1 , 4 0 , 3 3 , 0 2 , 4 1 , 3 0 , 2 4 , 0 3 , 4 2 , 3 1 , 2 0 , 1 4 , 4 3 , 3 2 , 2 1 , 1

  9. � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � iARt D 4 4 , 4 4 , 0 3 , 1 4 , 2 0 , 4 2 , 0 34 , 1 34 , 12 0 , 2 3 , 0 4 , 1 3 , 2 0 , 3 1 , 0 2 , 1 34 , 2 0 , 1 3 , 3 1 , 1 2 , 2

  10. � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � iARt E 6 6 , 6 5 , 5 4 , 4 3 , 3 1 , 1 6 , 0 5 , 6 4 , 5 23 , 4 1 , 6 2 , 5 3 , 4 1 , 3 0 , 5 , 0 4 , 6 23 , 5 123 , 46 12 , 56 23 , 45 1 , 4 0 , 3 4 , 0 23 , 6 123 , 56 123 , 456 12 , 45 0 , 4 12 2 3 , 456 3 , 0 12 , 6 23 , 56 123 , 45 12 , 46 0 , 5 1 , 0 2 , 6 3 , 5 12 , 4 0 , 6 2 , 0 3 , 6 12 , 5 23 , 46 1 , 5 2 , 4 0 , 2 2 , 2

  11. A Basis of A G ◮ There is a basis of A G parametrized by µ -supported g-vectors. ◮ All such g-vectors lies in a cone, which can be explicitly described by the representation theory of ∆ 2 Q . ◮ For each frozen vertex v of ∆ 2 Q , there is an associated boundary representation T v . ◮ The cone has a hyperplane presentation { x ∈ R (∆ 2 Q ) 0 | Hx ≥ 0 } where the rows of the matrix H are given by the dimension vectors of subrepresentations of T v ’s.

  12. A Basis of A G ◮ There is a basis of A G parametrized by µ -supported g-vectors. ◮ All such g-vectors lies in a cone, which can be explicitly described by the representation theory of ∆ 2 Q . ◮ For each frozen vertex v of ∆ 2 Q , there is an associated boundary representation T v . ◮ The cone has a hyperplane presentation { x ∈ R (∆ 2 Q ) 0 | Hx ≥ 0 } where the rows of the matrix H are given by the dimension vectors of subrepresentations of T v ’s.

  13. A Basis of A G ◮ There is a basis of A G parametrized by µ -supported g-vectors. ◮ All such g-vectors lies in a cone, which can be explicitly described by the representation theory of ∆ 2 Q . ◮ For each frozen vertex v of ∆ 2 Q , there is an associated boundary representation T v . ◮ The cone has a hyperplane presentation { x ∈ R (∆ 2 Q ) 0 | Hx ≥ 0 } where the rows of the matrix H are given by the dimension vectors of subrepresentations of T v ’s.

  14. A Basis of A G ◮ There is a basis of A G parametrized by µ -supported g-vectors. ◮ All such g-vectors lies in a cone, which can be explicitly described by the representation theory of ∆ 2 Q . ◮ For each frozen vertex v of ∆ 2 Q , there is an associated boundary representation T v . ◮ The cone has a hyperplane presentation { x ∈ R (∆ 2 Q ) 0 | Hx ≥ 0 } where the rows of the matrix H are given by the dimension vectors of subrepresentations of T v ’s.

  15. � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � Boundary Representations in iARt A 4 1 , 0 0 , 4 2 , 0 1 , 4 0 , 3 3 , 0 2 , 4 1 , 3 0 , 2 4 , 0 3 , 4 2 , 3 1 , 2 0 , 1 4 , 4 3 , 3 2 , 2 1 , 1

  16. � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � Boundary Representations in iARt A 4 1 , 0 0 , 4 2 , 0 1 , 4 0 , 3 3 , 0 2 , 4 1 , 3 0 , 2 4 , 0 3 , 4 2 , 3 1 , 2 0 , 1 4 , 4 3 , 3 2 , 2 1 , 1

  17. � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � Boundary Representations in iARt A 4 1 , 0 0 , 4 2 , 0 1 , 4 0 , 3 3 , 0 2 , 4 1 , 3 0 , 2 4 , 0 3 , 4 2 , 3 1 , 2 0 , 1 4 , 4 3 , 3 2 , 2 1 , 1

  18. � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � A Boundary Representation in iARt D 4 0 0 k 0 0 0 k k 0 0 0 0 k 0 k 0 k 0 0 k

  19. The Generic Cluster Character Given a vector g ∈ Z (∆ 2 Q ) 0 , we can associate a generic representation M := Coker(g) of (∆ 2 Q , W 2 Q ). The generic character CC maps µ -supported g-vectors (lattice points in the cone) to the upper cluster algebra. CC (g) = x g � Gr e ( M ) y e . � � χ e Theorem (Fei) The generic cluster character maps the lattice points in the cone to a basis of A G . Corollary The multiplicity c λ µ,ν is counted by lattice points in the fibre polytope of the cone defined by ( µ, ν, λ ) .

  20. The Generic Cluster Character Given a vector g ∈ Z (∆ 2 Q ) 0 , we can associate a generic representation M := Coker(g) of (∆ 2 Q , W 2 Q ). The generic character CC maps µ -supported g-vectors (lattice points in the cone) to the upper cluster algebra. CC (g) = x g � Gr e ( M ) y e . � � χ e Theorem (Fei) The generic cluster character maps the lattice points in the cone to a basis of A G . Corollary The multiplicity c λ µ,ν is counted by lattice points in the fibre polytope of the cone defined by ( µ, ν, λ ) .

  21. The Generic Cluster Character Given a vector g ∈ Z (∆ 2 Q ) 0 , we can associate a generic representation M := Coker(g) of (∆ 2 Q , W 2 Q ). The generic character CC maps µ -supported g-vectors (lattice points in the cone) to the upper cluster algebra. CC (g) = x g � Gr e ( M ) y e . � � χ e Theorem (Fei) The generic cluster character maps the lattice points in the cone to a basis of A G . Corollary The multiplicity c λ µ,ν is counted by lattice points in the fibre polytope of the cone defined by ( µ, ν, λ ) .

  22. Thank you Happy Birthday to Professor Chari!

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend


More recommend