The permutation-equivariance conjecture for the rigged-configuration bijection

Let B=k=1NBrk,skB = \bigotimes_{k=1}^N B^{r_k,s_k} and let B=k=1NBrk,skB' = \bigotimes_{k=1}^N B^{r'_k,s'_k} be any reordering of the same tensor factors. Let RC(B)\operatorname{RC}(B) and RC(B)\operatorname{RC}(B') be the corresponding rigged-configuration models, let Φ\Phi be the crystal bijection, and let R ⁣:BBR\colon B\to B' be the crystal isomorphism induced by the reordering.

Permutation-equivariance conjecture. The diagram relating RC(B)\operatorname{RC}(B) to RC(B)\operatorname{RC}(B') by the identity and BB to BB' by RR, with vertical maps given by Φ\Phi, commutes for any reordering BB'.

This asserts that the rigged-configuration bijection is compatible with reordering tensor factors. It is stated conjecturally in the supplied source, with no resolution indicated.

Sources & referencesView supporting material

Primary source

Xuan Liu and Travis Scrimshaw, “A uniform approach to soliton cellular automata using rigged configurations”, arXiv:1706.02443 (2019).

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.