C-sortable words as green mutation sequences
arXiv:1205.0034 · doi:10.1112/plms/pdv046
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.
arXiv commentLast version, to appear in PLMS
References in corpus (11)
- Cluster structures for 2-Calabi-Yau categories and unipotent groups
- T-Branes and Monodromy
- Clusters, Coxeter-sortable elements and noncrossing partitions
- Noncrossing partitions and representations of quivers
- Braids, Walls, and Mirrors
- Exchange graphs and Ext quivers
- Stability conditions and quantum dilogarithm identities for Dynkin quivers
- Donaldson-Thomas theory and cluster algebras
- Preprojective algebras and c-sortable words
- From m-clusters to m-noncrossing partitions via exceptional sequences
- Coloured quiver mutation for higher cluster categories
Cited by in corpus (7)
- Stability conditions and quantum dilogarithm identities for Dynkin quivers
- Decorated marked surfaces: spherical twists versus braid twists
- Contractible stability spaces and faithful braid group actions
- A survey on maximal green sequences
- On Maximal Green Sequences
- Horizontal and vertical mutation fans
- Lengths of maximal green sequences for tame path algebras