2000 character limit reached
Generalizations of Laver tables
Published 6 Dec 2018 in math.LO, cs.CR, and math.CO | (1812.02761v1)
Abstract: We shall generalize the notion of a Laver table to algebras which may have many generators, several fundamental operations, fundamental operations of arity higher than 2, and to algebras where only some of the operations are self-distributive or where the operations satisfy a generalized version of self-distributivity. These algebras mimic the algebras of rank-into-rank embeddings $\mathcal{E}_{\lambda}/\equiv{\gamma}$ in the sense that composition and the notion of a critical point make sense for these sorts of algebras.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.