C-sortable words as green mutation sequences

Authors Yu Qiu

Publication date 18 December 2015

Abstract: Let

Q

be an acyclic quiver and

m a t h b f s

be a sequence with elements in the vertex set

Q_{0}

. We describe an induced sequence of simple (backward) tilting in the bounded derived category

m a t h c a l D (Q)

, starting from the standard heart

m a t h c a l H_{Q} = o p e r a t o r n a m e m o d m a t h b f k Q

and ending at another heart

m a t h c a l H_{m} a t h b f s

in

m a t h c a l D (Q)

. Then we show that

m a t h b f s

is a green mutation sequence if and only if every heart in this simple tilting sequence is greater than or equal to

m a t h c a l H_{Q} [- 1]

; it is maximal if and only if

m a t h c a l H_{m} a t h b f s = m a t h c a l H_{Q} [- 1]

. This provides a categorical way to understand green mutations. Further, fix a Coxeter element

c

in the Coxeter group

W_{Q}

of

Q

, which is admissible with respect to the orientation of

Q

. We prove that the sequence

w i d e t i l d e m a t h b f w

induced by a

c

-sortable word

m a t h b f w

is a green mutation sequence. As a consequence, we obtain a bijection between

c

-sortable words and finite torsion classes in

m a t h c a l H_{Q}

. As byproducts, the interpretations of inversions, descents and cover reflections of a

c

-sortable word

m a t h b f w

are given in terms of the combinatorics of green mutations.

Recommendations

Cites work

Cited in

(9)

This page was built for publication: C-sortable words as green mutation sequences