We use combinatorics of quivers and the corresponding surfaces to study maximal green sequences of minimal length for quivers of type A. We prove that such sequences have length 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.
|Number of pages||26|
|Journal||Journal of Algebraic Combinatorics|
|State||Published - Dec 1 2016|
Bibliographical noteFunding Information:
This research was carried out at the University of Connecticut 2015 math REU funded by National Science Foundation under DMS-1262929. The fourth author was also supported by the National Science Foundation CAREER Grant DMS-1254567.
© 2016, Springer Science+Business Media New York.
- Cluster algebra
- Maximal green sequence
- Surface triangulation
ASJC Scopus subject areas
- Algebra and Number Theory
- Discrete Mathematics and Combinatorics