C-sortable words as green mutation sequences
Abstract
Let be an acyclic quiver and be a sequence with elements in the vertex set . We describe an induced sequence of simple (backward) tilting in the bounded derived category , starting from the standard heart and ending at another heart in . Then we show that is a green mutation sequence if and only if every heart in this simple tilting sequence is greater than or equal to ; it is maximal if and only if . This provides a categorical way to understand green mutations. Further, fix a Coxeter element in the Coxeter group of , which is admissible with respect to the orientation of . We prove that the sequence induced by a -sortable word is a green mutation sequence. As a consequence, we obtain a bijection between -sortable words and finite torsion classes in . As byproducts, the interpretations of inversions, descents and cover reflections of a -sortable word are given in terms of the combinatorics of green mutations.
Cite
@article{arxiv.1205.0034,
title = {C-sortable words as green mutation sequences},
author = {Yu Qiu},
journal= {arXiv preprint arXiv:1205.0034},
year = {2017}
}
Comments
Last version, to appear in PLMS