Hindman's Theorem, Ellis's Lemma, and Thompson's group F
classification
🧮 math.CO
math.DSmath.FAmath.GNmath.GRmath.LO
keywords
conjecturesellisgrouphindmanlemmatheoremthompsonamenability
read the original 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 $F$. Partial results are obtained for both conjectures. The paper will also contain some general analysis of the conjectures.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.