Coxeter-Knuth graphs and a signed little map for type B reduced words

From MaRDI portal
Publication:463045

zbMATH Open1298.05006arXiv1405.4891MaRDI QIDQ463045FDOQ463045

Zachary Hamaker, Austin Roberts, Benjamin Young, Sara Billey

Publication date: 23 October 2014

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Abstract: 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 tableau of Kra'{s}kiewicz insertion, and that it provides a bijective realization of the Type B transition equations in Schubert calculus. Many other aspects of type A theory carry over to this new setting. Our primary tool is a shifted version of the dual equivalence graphs defined by Assaf and further developed by Roberts. We provide an axiomatic characterization of shifted dual equivalence graphs, and use them to prove a structure theorem for the graph of Type B Coxeter-Knuth relations.


Full work available at URL: https://arxiv.org/abs/1405.4891

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)





Cites Work


Cited In (7)






This page was built for publication: Coxeter-Knuth graphs and a signed little map for type B reduced words

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q463045)