Skip to content

An expansion algorithm for constructing axial algebras

Research output: Contribution to journalArticle

Original languageEnglish
Pages (from-to)379-409
Number of pages34
JournalJournal of Algebra
Early online date21 Jan 2020
DateAccepted/In press - 16 Jan 2020
DateE-pub ahead of print (current) - 21 Jan 2020
DatePublished - 15 May 2020


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-closedness 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.

    Research areas

  • axial algebra, nonassociative algebra, Majorana algebra, finite groups, algorithm



  • Full-text PDF (author’s accepted manuscript)

    Rights statement: This is the author accepted manuscript (AAM). The final published version (version of record) is available online via Elsevier at! . Please refer to any applicable terms of use of the publisher.

    Accepted author manuscript, 403 KB, PDF document

    Embargo ends: 21/01/22

    Request copy


View research connections

Related faculties, schools or groups