Papers
Topics
Authors
Recent
2000 character limit reached

Iterative algebras

Published 5 Mar 2015 in math.RA | (1503.01632v1)

Abstract: Given a finitely generated free monoid $X$ and a morphism $\phi : X\to X$, we show that one can construct an algebra, which we call an iterative algebra, in a natural way. We show that many ring theoretic properties of iterative algebras can be easily characterized in terms of linear algebra and combinatorial data from the morphism and that, moreover, it is decidable whether or not an iterative algebra has these properties. Finally, we use our construction to answer several questions of Greenfeld, Leroy, Smoktunowicz, and Ziembowski by constructing a primitive graded nilpotent algebra with Gelfand-Kirillov dimension two that is finitely generated as a Lie algebra.

Summary

Paper to Video (Beta)

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.

Authors (2)

Collections

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