2011/06/03 by Andrew T. Carroll, Jerzy Weyman, Carroll, Andrew T. +1
Computer Science · #16G20 #Algorithms and Data Compression #Coding theory and cryptography #FOS: Mathematics #Representation Theory (math.RT) #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.1106.0774
openalex publication_date 2011/06/03 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In this article we give an algorithm for determining the generators and relations for the rings of semi-invariant functions on irreducible components of representation spaces for gentle string algebras. These rings of semi-invariants turn out to be semigroup rings to which we can associate a so-called matching graph. Under this association, generators for the semigroup can be seen by certain walks on this graph, and relations are given by certain configurations in the graph. This allows us to determine degree bounds for the generators and relations of these rings. We furthermore show that these bounds also hold for acyclic string algebras in general.