Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 175 tok/s
Gemini 2.5 Pro 54 tok/s Pro
GPT-5 Medium 38 tok/s Pro
GPT-5 High 37 tok/s Pro
GPT-4o 108 tok/s Pro
Kimi K2 180 tok/s Pro
GPT OSS 120B 447 tok/s Pro
Claude Sonnet 4.5 36 tok/s Pro
2000 character limit reached

Iterative algebras (1503.01632v1)

Published 5 Mar 2015 in math.RA

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

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Open Problems

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

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

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

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

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