English

C-sortable words as green mutation sequences

Combinatorics 2017-05-17 v3 Representation Theory

Abstract

Let QQ be an acyclic quiver and s\mathbf{s} be a sequence with elements in the vertex set Q0Q_0. We describe an induced sequence of simple (backward) tilting in the bounded derived category D(Q)\mathcal{D}(Q), starting from the standard heart HQ=modkQ\mathcal{H}_Q=\operatorname{mod}\mathbf{k}Q and ending at another heart Hs\mathcal{H}_\mathbf{s} in D(Q)\mathcal{D}(Q). Then we show that s\mathbf{s} is a green mutation sequence if and only if every heart in this simple tilting sequence is greater than or equal to HQ[1]\mathcal{H}_Q[-1]; it is maximal if and only if Hs=HQ[1]\mathcal{H}_\mathbf{s}=\mathcal{H}_Q[-1]. This provides a categorical way to understand green mutations. Further, fix a Coxeter element cc in the Coxeter group WQW_Q of QQ, which is admissible with respect to the orientation of QQ. We prove that the sequence w~\widetilde{\mathbf{w}} induced by a cc-sortable word w\mathbf{w} is a green mutation sequence. As a consequence, we obtain a bijection between cc-sortable words and finite torsion classes in HQ\mathcal{H}_Q. As byproducts, the interpretations of inversions, descents and cover reflections of a cc-sortable word w\mathbf{w} 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

R2 v1 2026-06-21T20:56:52.271Z