Mathematics > Logic
arXiv:2501.06733 (math)
[Submitted on 12 Jan 2025 (v1), last revised 3 Jul 2026 (this version, v5)]
Abstract:We present some new lower bound estimates for certain numbers in Laver table theory and introduce several related structures of interest.
| Comments: | Thanks the AI for math team of Peking University, Jiang Jiedong, Zhang Zhiyuan and Chen Leheng so much, for using Lean 4 to formalize the main theorem of this work, and finding many typos during their formalization |
| Subjects: | Logic (math.LO); Combinatorics (math.CO) |
| Cite as: | arXiv:2501.06733 [math.LO] |
| (or arXiv:2501.06733v5 [math.LO] for this version) | |
| https://doi.org/10.48550/arXiv.2501.06733 arXiv-issued DOI via DataCite |
Submission history
From: Renrui Qi [view email]
[v1]
Sun, 12 Jan 2025 07:08:03 UTC (14 KB)
[v2]
Tue, 25 Feb 2025 04:33:07 UTC (14 KB)
[v3]
Thu, 27 Feb 2025 13:48:49 UTC (14 KB)
[v4]
Mon, 17 Nov 2025 17:06:22 UTC (35 KB)
[v5]
Fri, 3 Jul 2026 17:01:12 UTC (35 KB)
Bibliographic Tools
Bibliographic and Citation Tools
Bibliographic Explorer Toggle
Code, Data, Media
Code, Data and Media Associated with this Article
Demos
Demos
Related Papers
Recommenders and Search Tools
About arXivLabs
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.





















