2 papers
math.CO2022
Lenart's bijection via bumpless pipe dreams
Adam Gregory, Zachary Hamaker
Pipe dreams and bumpless pipe dreams for vexillary permutations are each known to be in bijection with certain semistandard tableaux via maps due to Lenart and Weigandt, respective…
math.CO2014
Coxeter-Knuth graphs and a signed Little map for type B reduced words
Sara Billey, Zachary Hamaker, Austin Roberts +1
We define an analog of David Little's algorithm for reduced words in type B, and investigate its main properties. In particular, we show that our algorithm preserves the recording…