2020/10/28 by Alexander Garver, Garver, Alexander, Khrystyna Serhiyenko +1
Computer Science · Mathematics · #05E10 #16G20 #18E40 #Advanced Combinatorial Mathematics #Coding theory and cryptography #Combinatorics (math.CO) #FOS: Mathematics #Representation Theory (math.RT) #math.CO #math.RT #msc:05E10 #msc:16G20 #msc:18E40 #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.2010.15230
comments welcome
arxiv created 2020/10/28 · openalex publication_date 2020/10/28 · arxiv updated 2020/10/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Maximal green sequences are important objects in representation theory, cluster algebras, and string theory. The two fundamental questions about maximal green sequences are whether a given algebra admits such sequences and, if so, does it admit only finitely many. We study maximal green sequences in the case of string algebras and give sufficient conditions on the algebra that ensure an affirmative answer to these questions.