Laver tables and combinatorics
Philippe Biane (LIGM)

TL;DR
This paper introduces Laver tables, finite combinatorial objects from logic and set theory, highlighting their properties and open problems to engage the combinatorics community.
Contribution
It provides the first accessible introduction to Laver tables, detailing their definition, properties, and open problems, bridging logic and combinatorics.
Findings
Laver tables have unique combinatorial properties.
They connect logic, set theory, and combinatorics.
Open problems suggest further research directions.
Abstract
The Laver tables are finite combinatorial objects with a simple elementary definition, which were introduced by R. Laver 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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Combinatorial Mathematics · Geometric and Algebraic Topology · semigroups and automata theory
