Lusztig-involution conjecture for general Lascoux polynomials and atoms

Let λ\lambda be a partition and let SVn(λ)\operatorname{SV}^n(\lambda) be the set of semistandard set-valued tableaux of shape λ\lambda. For a tableau TT, define its right K-key tableau by

K(T):=k(min(T)),K(T):=k(\min(T^*)^*),

where TT^* is obtained using the Lusztig involution on each irreducible crystal component, min(T)\min(T) takes the least entry in each box, and kk is the right key tableau of a semistandard tableau. Set

SVwn(λ)={TSVn(λ)K(T)Kwλ},\operatorname{SV}^n_w(\lambda)=\{T\in\operatorname{SV}^n(\lambda)\mid K(T)\preceq K_{w\lambda}\}, SVwn(λ)={TSVn(λ)K(T)=Kwλ}.\overline{\operatorname{SV}}^n_w(\lambda)=\{T\in\operatorname{SV}^n(\lambda)\mid K(T)=K_{w\lambda}\}.

Lusztig-involution conjecture. For every partition λ\lambda,

Lwλ(x;β)=TSVwn(λ)wtβ(T),L_{w\lambda}(\mathbf{x};\beta)=\sum_{T\in\operatorname{SV}^n_w(\lambda)}\operatorname{wt}_{\beta}(T),

and

Lwλ(x;β)=TSVwn(λ)wtβ(T).\overline{L}_{w\lambda}(\mathbf{x};\beta)=\sum_{T\in\overline{\operatorname{SV}}^n_w(\lambda)}\operatorname{wt}_{\beta}(T).

The preceding key-tableau formulas are proved for rectangular shapes but fail for general partitions; the conjecture proposes that inserting the Lusztig involution repairs the formulas and gives combinatorial interpretations of general Lascoux polynomials and atoms.

Sources & referencesView supporting material

Primary source

Oliver Pechenik and Travis Scrimshaw, “K-theoretic crystals for set-valued tableaux of rectangular shapes”, arXiv:1904.09674 (2022).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.