arXiv:1508.02954 [math.CO]AbstractReferencesReviewsResources
Minimal Length Maximal Green Sequences and Triangulations of Polygons
Emily Cormier, Peter Dillery, Jill Resh, Khrystyna Serhiyenko, John Whelan
Published 2015-08-12Version 1
We use combinatorics of quivers and the corresponding surfaces to study maximal green sequences of minimal length for quivers of type $\mathbb{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.
Comments: 22 pages, 1 figure
Related articles: Most relevant | Search more
arXiv:1408.4866 [math.CO] (Published 2014-08-21)
Combinatorics of Regular Partitions
arXiv:0806.2599 [math.CO] (Published 2008-06-16)
The combinatorics of k-marked Durfee symbols
arXiv:0704.2518 [math.CO] (Published 2007-04-19)
Combinatorics Of RNA Structures With Pseudoknots