Bottom-tree invariance of rectification in d-complete posets

About 8 years old · traced to

Let P\mathcal{P} be a dd-complete poset with bottom tree B\mathcal{B}. Let TT be a skew increasing P\mathcal{P}-tableau, and let RR and SS be rectifications of TT. Bottom-tree rectification conjecture. The restrictions of the rectifications to the bottom tree agree:

R∣B=S∣B.R|_{\mathcal{B}}=S|_{\mathcal{B}}.

This generalizes the proved unique-rectification result for chained double-tailed diamond posets and provides additional experimental evidence toward the broader unique-rectification-target conjecture. It asserts invariance on the bottom tree even when the full rectification need not yet be known to be unique.

References

Primary source

Rahul Ilango, Oliver Pechenik and Michael Zlatin, “Unique rectification in d-complete posets: towards the K-theory of Kac-Moody flag varieties”, arXiv:1805.02287 (2018).

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.