An expansion algorithm for constructing axial algebras

From MaRDI portal
Publication:2295394



Abstract: An axial algebra A is a commutative non-associative algebra generated by primitive idempotents, called axes, whose adjoint action on A is semisimple and multiplication of eigenvectors is controlled by a certain fusion law. Different fusion laws define different classes of axial algebras. Axial algebras are inherently related to groups. Namely, when the fusion law is graded by an abelian group T, every axis a leads to a subgroup of automorphisms Ta of A. The group generated by all Ta is called the Miyamoto group of the algebra. We describe a new algorithm for constructing axial algebras with a given Miyamoto group. A key feature of the algorithm is the expansion step, which allows us to overcome the 2-closeness restriction of Seress's algorithm computing Majorana algebras. At the end we provide a list of examples for the Monster fusion law, computed using a MAGMA implementation of our algorithm.


This paper studies the construction of axial algebras. When the fusion law is graded by an abelian group \(T\), every axis a leads to a subgroup of automorphisms \(T_a\) of \(A\). The group generated by all \(T_a\) is called the Miyamoto group of the algebra. The authors describe a new algorithm for constructing axial algebras with a given Miyamoto group. They overcome the \(2\)-closedness restriction of Seress' algorithm computing Majorana algebras.





Describes a project that uses

Uses Software






This page was built for publication: An expansion algorithm for constructing axial algebras

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2295394)