In mathematics, Laver tables (named after Richard Laver, who discovered them towards the end of the 1980s in connection with his works on set theory) are tables of numbers that have certain properties.
For a given a natural number n, one can define the n-th Laver table (with 2n rows and columns) by setting
where p denotes the row and q denotes the column of the entry. Define
and then calculate the remaining entries of each row from the m-th to the first using the equation
The resulting table is then called the n-th Laver table; for example, for n = 2, we have:
When looking at the first row of entries in a Laver table, it can be seen that the entries repeat with a certain periodicity m. This periodicity is always a power of 2; the first few periodicities are 1, 1, 2, 4, 4, 8, 8, 8, 8, 16, 16, ... (sequence A098820 in OEIS). The sequence is increasing, and it was proved in 1995 by Richard Laver that under the assumption that there exists a rank-into-rank (a large cardinal), it actually increases without bound. Nevertheless, it grows extremely slowly; Randall Dougherty showed that the first n for which the table entries' period can possibly be 32 is A(9,A(8,A(8,255))), where A denotes the Ackermann function.
- Patrick Dehornoy, "Das Unendliche als Quelle der Erkenntnis", in: Spektrum der Wissenschaft Spezial 1/2001, pp. 86–90
- R. Laver, On the Algebra of Elementary Embeddings of a Rank into Itself, Advances in Mathematics 110, p. 334, 1995 arXiv:math.LO/9204204
- R. Dougherty, Critical Points in an Algebra of Elementary Embeddings, Annals of Pure and Applied Logic 65, p. 211, 1993 arXiv:math.LO/9205202
- Patrick Dehornoy, Diagrams colourings and applications, Proceedings of the East Asian School of Knots, Links and Related Topics, 2004 (online)