Séminaire Lotharingien de Combinatoire, B80c (2019), 24 pp.
Philippe Biane
Laver Tables and Combinatorics
Abstract.
The Laver tables are finite combinatorial objects with a simple
elementary definition, which were introduced by R. Laver in
[Adv. Math. 91 (1992), 209-231] from considerations of logic and set theory.
Although these objects exhibit some fascinating properties, they
seem to have escaped notice from the combinatorics community. My aim
is to give a short introduction to this topic, presenting the
definition and main properties and stating a few open problems, which
should arouse the interest of combinatorialists
Received: October 2, 2018.
Accepted: October 31, 2019.
Final Version: November 13, 2019.
The following versions are available: