2000 character limit reached
Minimal length maximal green sequences
Published 23 Feb 2017 in math.CO and math.RT | (1702.07313v1)
Abstract: Maximal green sequences are important objects in representation theory, cluster algebras, and string theory. It is an open problem to determine what lengths are achieved by the maximal green sequences of a quiver. We combine the combinatorics of surface triangulations and the basics of scattering diagrams to address this problem. Our main result is a formula for the length of minimal length maximal green sequences of quivers defined by triangulations of an annulus or a punctured disk.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.