Papers
Topics
Authors
Recent
Search
2000 character limit reached

Miyamoto groups of code algebras

Published 23 Jan 2020 in math.GR | (2001.08426v2)

Abstract: A code algebra $A_C$ is a nonassociative commutative algebra defined via a binary linear code $C$. In a previous paper, we classified when code algebras are $\mathbb{Z}_2$-graded axial (decomposition) algebras generated by small idempotents. In this paper, for each algebra in our classification, we obtain the Miyamoto group associated to the grading. We also show that the code algebra structure can be recovered from the axial decomposition algebra structure.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

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.

Collections

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