Abstract

We use combinatorics of quivers and the corresponding surfaces to study maximal green sequences of minimal length for quivers of type $$\mathbb {A}$$A. We prove that such sequences have length $$n+t$$n+t, where n is the number of vertices and t is the number of 3-cycles in the quiver. Moreover, we develop a procedure that yields these minimal length maximal green sequences.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call