Expander Evolution Algebras
Abstract
We introduce expander evolution algebras (EEAs), a class of nonassociative algebras defined over an arbitrary field in which the underlying undirected loopless graph of the algebra -- in the sense of Kowalski -- is an expander graph in the classical sense of Cheeger. Starting from the formal graph definition of Kowalski and the algebraic framework of Tian, we establish a dictionary between combinatorial expansion and algebraic structure: the Cheeger constant of the associated graph governs connectivity, the subalgebra lattice, the growth of the evolution sequence, and -- over and -- the spectral gap of the evolution operator. Over a general field we prove that EEAs are always connected and simple (as evolution algebras), carry no proper large evolution subalgebras, and that every generator of a symmetric EEA is algebraically persistent. Over we obtain the sharp Alon--Boppana lower bound for the second eigenvalue of the evolution operator, leading to the definition of Ramanujan evolution algebras as optimal expanders. We also construct families of EEAs from Cayley graphs of finite groups. We close with open problems.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.