Products of reflections in smooth Bruhat intervals
arXiv:2110.13314
Abstract
A permutation is called smooth if the corresponding Schubert variety is smooth. Gilboa and Lapid prove that in the symmetric group, multiplying the reflections below a smooth element in Bruhat order in a compatible order yields back the element . We strengthen this result by showing that such a product in fact determines a saturated chain in Bruhat order, and that this property characterizes smooth elements.
9 pages