Derived tame monomial algebras

arXiv:2610.41759 · math.RT, math.RA · Submitted 2026-10-30 · Read on arXiv

math.RT, math.RA

Submitted: 2026-10-30

Updated: 2026-10-30

Comments: 17pages

License: http://creativecommons.org/licenses/by/4.0/

The gist: We prove that a finite-dimensional connected monomial algebra over an algebraically closed field is derived tame if and only if every finite connected convex subcategory of its universal cover has…

Abstract

We prove that a finite-dimensional connected monomial algebra over an algebraically closed field is derived tame if and only if every finite connected convex subcategory of its universal cover has non-negative Euler form. Derived tameness is also equivalent to tameness of its repetitive category and trivial extension. For one-cycle algebras, this condition is equivalent to the non-negativity on R of Q 0 explicitly computable polynomials in Q[t]. This gives a finite algorithm for deciding derived tameness. We also construct an infinite family of derived-tame one-cycle string algebras with minimal cubic relations, no two of which are derived equivalent.

Sources

Related papers