Minimal length maximal green sequences and triangulations of polygons

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

doi:10.1007/s10801-016-0694-6

Minimal length maximal green sequences and triangulations of polygons

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

Mathematics

Producción científica: Article › revisión exhaustiva

8 Citas (SciVal)

Resumen

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.

Idioma original	English
Páginas (desde-hasta)	905-930
Número de páginas	26
Publicación	Journal of Algebraic Combinatorics
Volumen	44
N.º	4
DOI	https://doi.org/10.1007/s10801-016-0694-6
Estado	Published - dic 1 2016

Nota bibliográfica

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

Financiación

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.

Financiadores	Número del financiador
National Science Foundation Arctic Social Science Program	DMS-1254567, DMS-1262929

ASJC Scopus subject areas

Algebra and Number Theory
Discrete Mathematics and Combinatorics

Acceder al documento

10.1007/s10801-016-0694-6

Otros archivos y enlaces

Citar esto

@article{f937b74de43b4ec2ab480b3061859fb8,

title = "Minimal length maximal green sequences and triangulations of polygons",

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.",

keywords = "Cluster algebra, Maximal green sequence, Surface triangulation",

author = "E. Cormier and P. Dillery and J. Resh and K. Serhiyenko and J. Whelan",

note = "Publisher Copyright: {\textcopyright} 2016, Springer Science+Business Media New York.",

year = "2016",

month = dec,

day = "1",

doi = "10.1007/s10801-016-0694-6",

language = "English",

volume = "44",

pages = "905--930",

number = "4",

}

TY - JOUR

T1 - Minimal length maximal green sequences and triangulations of polygons

AU - Cormier, E.

AU - Dillery, P.

AU - Resh, J.

AU - Serhiyenko, K.

AU - Whelan, J.

PY - 2016/12/1

Y1 - 2016/12/1

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

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

KW - Cluster algebra

KW - Maximal green sequence

KW - Surface triangulation

UR - https://www.scopus.com/pages/publications/84975316724

UR - https://www.scopus.com/pages/publications/84975316724#tab=citedBy

U2 - 10.1007/s10801-016-0694-6

DO - 10.1007/s10801-016-0694-6

M3 - Article

AN - SCOPUS:84975316724

SN - 0925-9899

VL - 44

SP - 905

EP - 930

JO - Journal of Algebraic Combinatorics

JF - Journal of Algebraic Combinatorics

IS - 4

ER -

Minimal length maximal green sequences and triangulations of polygons

Resumen

Nota bibliográfica

Financiación

ASJC Scopus subject areas

Acceder al documento

Otros archivos y enlaces

Huella

Citar esto