Hindman's Theorem, Ellis's Lemma, and Thompson's group $F$
Justin Tatch Moore

TL;DR
This paper explores conjectural extensions of Hindman's Theorem and Ellis's Lemma to nonassociative systems, aiming to address the amenability of Thompson's group F, and presents partial results and analysis of these conjectures.
Contribution
It introduces new conjectural generalizations of classical theorems for nonassociative systems and relates them to the open problem of Thompson's group F's amenability.
Findings
Partial results supporting the conjectures
Analysis of the conjectures' implications
Connections to the amenability problem for Thompson's group F
Abstract
The purpose of this article is to formulate conjectural generalizations of Hindman's Theorem and Ellis's Lemma for nonassociative binary systems and relate them to the amenability problem for Thompson's group . Partial results are obtained for both conjectures. The paper will also contain some general analysis of the conjectures.
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
TopicsFinite Group Theory Research · Geometric and Algebraic Topology · Limits and Structures in Graph Theory
