Primitivity of finitely presented monomial algebras

Simple item page
dc.creatorBell, Jason P.
dc.creatorPekcagliyan, Pinar
dc.date2007-12-05
dc.date.accessioned2026-07-07T08:47:30Z
dc.date.available2026-07-07T08:47:30Z
dc.descriptionWe study prime monomial algebras. Our main result is that a prime finitely presented monomial algebra is either primitive or it has GK dimension one and satisfies a polynomial identity. More generally, we show this result holds for the class of \emph{automaton algebras}; that is, monomial algebras that have a basis consisting of the set of words recognized by some finite state automaton. This proves a special case of a conjecture of the first author and Agata Smoktunowicz.
dc.description3 figures
dc.identifierhttps://arxiv.org/abs/0712.0815
dc.identifierhttp://arxiv.org/abs/0712.0815
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/143619
dc.subjectRings and Algebras
dc.subject16P90
dc.titlePrimitivity of finitely presented monomial algebras
dc.typetext

Files

Collections

arXiv