The conjecture on the uniform rigged configuration bijection

About 9 years old · traced to

Let BB be a tensor product of Kirillov--Reshetikhin crystals of affine type. Let RC⁡(B)\operatorname{RC}(B) be the corresponding set of rigged configurations, let η\eta interchange riggings and coriggings, let DD be the energy statistic on BB, and let R:B→B′R:B\to B' be the combinatorial RR-matrix for a reordering B′B' of the tensor factors. The recursively defined map Φ~:RC⁡(B)→B\widetilde{\Phi}:\operatorname{RC}(B)\to B is obtained from the maps δ~\widetilde{\delta}, lb⁡\operatorname{lb}, and ls⁡\operatorname{ls}. Uniform bijection conjecture. The map Φ~\widetilde{\Phi} is a classical crystal isomorphism satisfying

D∘Φ~∘η=cc⁡,D\circ\widetilde{\Phi}\circ\eta=\operatorname{cc},

and the diagram expressing compatibility with RR commutes:

RC⁡(B)→Φ~Bid⁡↓↓RRC⁡(B′)→Φ~B′.\begin{CD} \operatorname{RC}(B) @>{\widetilde{\Phi}}>> B\\ @V{\operatorname{id}}VV @VV{R}V\\ \operatorname{RC}(B') @>{\widetilde{\Phi}}>> B'. \end{CD}

This consolidates conjectures about the rigged configuration bijection, its statistics, and its compatibility with factor reordering; the paper proves the assertion in a substantial range of affine types, while the stated general form remains open.

References

Primary source

Travis Scrimshaw, “Uniform description of the rigged configuration bijection”, arXiv:1703.08945 (2020).

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.