Abstract
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.
| Original language | English |
|---|---|
| Pages (from-to) | 905-930 |
| Number of pages | 26 |
| Journal | Journal of Algebraic Combinatorics |
| Volume | 44 |
| Issue number | 4 |
| DOIs | |
| State | Published - Dec 1 2016 |
Bibliographical note
Publisher Copyright:© 2016, Springer Science+Business Media New York.
Funding
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.
| Funders | Funder number |
|---|---|
| National Science Foundation Arctic Social Science Program | DMS-1254567, DMS-1262929 |
Keywords
- Cluster algebra
- Maximal green sequence
- Surface triangulation
ASJC Scopus subject areas
- Algebra and Number Theory
- Discrete Mathematics and Combinatorics
Fingerprint
Dive into the research topics of 'Minimal length maximal green sequences and triangulations of polygons'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver