2000 character limit reached
A construction of simple-minded systems over domestic Brauer graph algebras
Published 29 Sep 2025 in math.RT | (2509.24184v1)
Abstract: Let be a 2-domestic Brauer graph algebra. We present a construction for a family of objects on -$\stmod$ to be a simple-minded system and our construction provides all simple-minded systems on -$\stmod$. As a byproduct, we provide a new proof of AR-conjecture for 2-domestic Brauer graph algebras and we prove that a weakly simple-minded system with a finite cardinality is a simple-minded system on -$\stmod$. We also prove that an orthogonal system which contains at least one object for an Euclidean component extends to a simple-minded system on -$\stmod$ and its extension closure is functorially finite.
Paper Prompts
Sign up for free to create and run prompts on this paper.