# Comparing the Edelman-Greene bijection to David Little's bijection

In their 1987 paper "Balanced Tableaux", Edelman and Greene construct a bijection between standard young tableaux with staircase shape $(n-1,n-2, \dots , 1)$ and reduced decompositions of the reverse permutation $(n,n-1, \dots, 1)$. The bijection is constructed using jeu de taquin and evacuation paths in forward direction and a modified version of RSK in the reverse.

David Little constructed a more general bijection between reduced decompositions of an arbitrary permutation and standard young tableaux of specific shapes in his 2003 paper "Combinatorial aspects of the Lascoux-Schutzenberger tree". His construction is, to my eyes, completely different, using line diagrams and circle diagrams (I don't know if these are standard terms). In the paper, he conjectures that his bijection, when specialized to the reverse permutation, recovers the Edelman-Greene bijection. It is know that the sets on which the bijections act coincide.

My questions are the following:

1. What is the current research status of Little's conjecture? Is it known whether the bijections are the same? Little states that he will investigate it further, but I am unaware of any new results.
2. Are there any other bijections between standard young tableaux with staircase shape and reduced decompositions of the reverse permutation? I am aware of Felsner's generalization of the Edelman-Greene bijection, but I am restricting my question to the case of the reverse permutation.
-