arXiv Analytics

Sign in

arXiv:1106.4735 [math.CO]AbstractReferencesReviewsResources

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

Justin Tatch Moore

Published 2011-06-23, updated 2018-07-16Version 4

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.

Comments: This paper has now appeared but is largely obsolete: Conjectures 1.3 and 1.4 have since been refuted by the author. arXiv admin note: text overlap with arXiv:1209.2063
Journal: Zbornik Radova. (Beograd), Selected topics in combinatorial analysis, 17(25):171-187, 2015
Subjects: 03E02, 03E50, 05D10, 05C55, 20F38, 43A07
Related articles: Most relevant | Search more
arXiv:0906.3885 [math.CO] (Published 2009-06-21, updated 2011-07-01)
A Simple Proof and Some Difficult Examples for Hindman's Theorem
arXiv:2012.02506 [math.CO] (Published 2020-12-04)
Ramsey monoids
arXiv:1807.05469 [math.CO] (Published 2018-07-15)
Idempotent means on free binary systems do not exist

Links

Toolbox