Reduced words for clans
Combinatorics
2018-06-15 v1
Abstract
Clans are combinatorial objects indexing the orbits of on the variety of flags in . This geometry leads to a partial order on the set of clans analogous to weak Bruhat order on the symmetric group, and we study the saturated chains in this order. We prove an analogue of the Matsumoto-Tits theorem on reduced words in a Coxeter group. We also obtain enumerations of reduced word sets for particular clans in terms of standard tableaux and shifted standard tableaux.
Cite
@article{arxiv.1806.05247,
title = {Reduced words for clans},
author = {Brian Burks and Brendan Pawlowski},
journal= {arXiv preprint arXiv:1806.05247},
year = {2018}
}
Comments
26 pages