English

Generalizations of Laver tables

Logic 2018-12-10 v1 Cryptography and Security Combinatorics

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 Eλ/γ\mathcal{E}_{\lambda}/\equiv^{\gamma} in the sense that composition and the notion of a critical point make sense for these sorts of algebras.

Keywords

Cite

@article{arxiv.1812.02761,
  title  = {Generalizations of Laver tables},
  author = {Joseph Van Name},
  journal= {arXiv preprint arXiv:1812.02761},
  year   = {2018}
}
R2 v1 2026-06-23T06:34:43.558Z