Papers
Topics
Authors
Recent
AI Research 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 71 tok/s
Gemini 2.5 Pro 50 tok/s Pro
GPT-5 Medium 21 tok/s Pro
GPT-5 High 19 tok/s Pro
GPT-4o 91 tok/s Pro
Kimi K2 164 tok/s Pro
GPT OSS 120B 449 tok/s Pro
Claude Sonnet 4 36 tok/s Pro
2000 character limit reached

Metabelian associative algebras (1312.5991v4)

Published 20 Dec 2013 in math.RA

Abstract: Metabelian algebras are introduced and it is shown that an algebra $A$ is metabelian if and only if $A$ is a nilpotent algebra having the index of nilpotency at most $3$, i.e. $x y z t = 0$, for all $x$, $y$, $z$, $t \in A$. We prove that the It^{o}'s theorem for groups remains valid for associative algebras. A structure theorem for metabelian algebras is given in terms of pure linear algebra tools and their classification from the view point of the extension problem is proven. Two border-line cases are worked out in detail: all metabelian algebras having the derived algebra of dimension $1$ (resp. codimension $1$) are explicitly described and classified. The algebras of the first family are parameterized by bilinear forms and classified by their homothetic relation. The algebras of the second family are parameterized by the set of all matrices $(X, Y, u) \in {\rm M}_{n}(k)2 \times kn$ satisfying $X2 = Y2 = 0$, $XY = YX$ and $Xu = Yu$.

Summary

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

Lightbulb On Streamline Icon: https://streamlinehq.com

Continue Learning

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

Authors (1)

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

Collections

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

Don't miss out on important new AI/ML research

See which papers are being discussed right now on X, Reddit, and more:

“Emergent Mind helps me see which AI papers have caught fire online.”

Philip

Philip

Creator, AI Explained on YouTube