Papers
Topics
Authors
Recent
Search
2000 character limit reached

Periodic String Complexes over String Algebras

Published 23 Jun 2020 in math.RT | (2006.14386v1)

Abstract: In this paper we develop combinatorial techniques for the case of string algebras with the aim to give a characterization of string complexes with infinite minimal projective resolution. These complexes will be called \textit{periodic string complexes}. As a consequence of this characterization, we give two important applications. The first one, is a sufficient condition for a string algebra to have infinite global dimension. In the second one, we exhibit a class of indecomposable objects in the derived category for a special case of string algebras. Every construction, concept and consequence in this paper is followed by some illustrative examples.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.