Minimal length maximal green sequences and triangulations of polygons

E. Cormier, P. Dillery, J. Resh, K. Serhiyenko, J. Whelan

Research output: Contribution to journalArticlepeer-review

7 Citations (SciVal)

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 languageEnglish
Pages (from-to)905-930
Number of pages26
JournalJournal of Algebraic Combinatorics
Volume44
Issue number4
DOIs
StatePublished - Dec 1 2016

Bibliographical note

Funding 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.

Publisher Copyright:
© 2016, Springer Science+Business Media New York.

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