C-sortable words as green mutation sequences

Abstract

Let Q be an acyclic quiver and s be a sequence with elements in the vertex set Q0. We describe an induced sequence of simple (backward) tilting in the bounded derived category D(Q), starting from the standard heart HQ=modkQ and ending at another heart Hs in D(Q). Then we show that 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]; it is maximal if and only if Hs=HQ[-1]. This provides a categorical way to understand green mutations. Further, fix a Coxeter element c in the Coxeter group WQ of Q, which is admissible with respect to the orientation of Q. We prove that the sequence w induced by a c-sortable word w is a green mutation sequence. As a consequence, we obtain a bijection between c-sortable words and finite torsion classes in HQ. As byproducts, the interpretations of inversions, descents and cover reflections of a c-sortable word w are given in terms of the combinatorics of green mutations.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…