arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1810.00548math.COmath.CT
收藏

紫菜表和组合数学

Laver tables and combinatorics

Philippe Biane

摘要:

Laver表是由R.从逻辑和集合论的考虑。虽然这些对象表现出一些迷人的特性,但它们似乎没有引起组合数学界的注意。本文的目的是对这一主题作一个简短的介绍,给出它的定义和主要性质,并提出几个有待解决的问题,以引起组合数学家的兴趣。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑