Alexei Borodin

13:24

Could you share the notes for this talk? They are not on the site yet.

Alexei Borodin

13:42

Maybe put the file in the chat?

Alexei Borodin

13:51

it does

Alexei Borodin

14:03

just drag the file into the chat window

Stephen J. Watson

14:12

depends on the settings

Benjamin Brubaker

38:41

You could say that the Lusztig data is parameterizing basis vectors in a hw representation.

Benjamin Brubaker

38:50

(Oh I see Dan beat me to it...)

Benjamin Brubaker

47:19

How do you know that intertwiners respect your decomposition into Lusztig data in general?

Benjamin Brubaker

47:27

Might that be a type A phenomenon?

Benjamin Brubaker

49:30

I think Kirillov has such a paper…

Siddhartha Sahi

52:30

Aren't there Gelfan Tsetlin patters for Orthogonal groups (B+D) together

Benjamin Brubaker

53:45

@Siddhartha - Yes. Proctor has a J. Algebra paper from the 90’s doing all kinds of branching rules for classical groups.

Valentin Buciumas

54:57

Can you build a *solvable* lattice model for every reduced decomposition of the longest word?

Travis Scrimshaw

55:09

@Siddhartha Valentin and I know how to do this for type B, but type D seems to be really hard

Travis Scrimshaw

55:38

For the usual character that is

Siddhartha Sahi

01:02:54

@Benjamin -- Perhaps the orthogonal branching is already due to Gelfand-Tsetlin?

Benjamin Brubaker

01:03:38

@Siddhartha - I used to attribute to Zhelobenko, but you are probably right.

Alexei Borodin

01:07:27

If Lusztig data parametrize basis vectors, what do colored Lusztig data parametrize?

Daniel Bump

01:09:31

It is an important question

Daniel Bump

01:12:21

These decompositions are parametrized by reduced words for the long Weyl group element

Alexei Borodin

01:13:05

In the colored case, do you also obtain vertex states' weight by computing the integrals over the corresponding piece?