Laver Tables and Combinatorics
Séminaire lotharingien de combinatoire, Tome 80 (2019-2021)

Voir la notice de l'acte provenant de la source Séminaire Lotharingien de Combinatoire website

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

@article{SLC_2019-2021_80_a2,
     author = {Philippe Biane},
     title = {Laver {Tables} and {Combinatorics}},
     journal = {S\'eminaire lotharingien de combinatoire},
     publisher = {mathdoc},
     volume = {80},
     year = {2019-2021},
     url = {http://geodesic.mathdoc.fr/item/SLC_2019-2021_80_a2/}
}
TY  - JOUR
AU  - Philippe Biane
TI  - Laver Tables and Combinatorics
JO  - Séminaire lotharingien de combinatoire
PY  - 2019-2021
VL  - 80
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/SLC_2019-2021_80_a2/
ID  - SLC_2019-2021_80_a2
ER  - 
%0 Journal Article
%A Philippe Biane
%T Laver Tables and Combinatorics
%J Séminaire lotharingien de combinatoire
%D 2019-2021
%V 80
%I mathdoc
%U http://geodesic.mathdoc.fr/item/SLC_2019-2021_80_a2/
%F SLC_2019-2021_80_a2
Philippe Biane. Laver Tables and Combinatorics. Séminaire lotharingien de combinatoire, Tome 80 (2019-2021). http://geodesic.mathdoc.fr/item/SLC_2019-2021_80_a2/