Infinite groups in a given variety and Ramsey’s theorem.

*(English)*Zbl 0751.20020The paper contains as its main results two group-theoretic theorems which are reminiscent of Ramsey’s Theorem in combinatorics and, in fact, use Ramsey’s Theorem in their proofs. The first result is the following. Let \(G\) be an infinite group and \(k\) a positive integer, \(k>1\). If for every sequence \(X_ 1,\dots,X_ k\) of \(k\) infinite subsets of \(G\) there exist elements \(x_ i\) of \(X_ i\), \(i=1,\dots,k\), such that \([x_ 1,\dots,x_ k]=1\) then \(G\) is nilpotent of class at most \(k-1\). (As usual \([x_ 1,\dots,x_ k]\) denotes the left-normed group commutator.) The authors also discuss an analogous general problem for varieties of groups which is solved by their result in the case of the variety of all nilpotent groups of class at most \(k-1\). The second main result of the paper concerns so-called “rewritable” groups. Let \(G\) be an infinite group and \(n\) a positive integer, \(n>1\). If for every sequence \(X_ 1,\dots,X_ n\) of \(n\) infinite subsets of \(G\) there exist elements \(x_ i\) of \(X_ i\), \(i=1,\dots,n\), and a non-trivial permutation \(\sigma\) of \(\{1,\dots,n\}\) such that \(x_ 1\dots x_ n=x_{\sigma(1)}\dots x_{\sigma(n)}\) then for every sequence \(x_ 1,\dots,x_ n\) of \(n\) elements of \(G\) there exists a non-trivial permutation \(\sigma\) of \(\{1,\dots,n\}\) such that \(x_ 1\dots x_ n=x_{\sigma(1)}\dots x_{\sigma(n)}\). It follows that \(G\) is finite-by-abelian-by-finite.

Reviewer: R.M.Bryant (Manchester)

##### MSC:

20E10 | Quasivarieties and varieties of groups |

20F12 | Commutator calculus |

20F18 | Nilpotent groups |

20E34 | General structure theorems for groups |

##### Keywords:

rewritable groups; Ramsey’s theorem; infinite subsets; left-normed group commutator; varieties of groups; nilpotent groups; finite-by-abelian-by- finite groups; Ramsey’s Theorem
PDF
BibTeX
XML
Cite

\textit{P. Longobardi} et al., Commun. Algebra 20, No. 1, 127--139 (1992; Zbl 0751.20020)

Full Text:
DOI

**OpenURL**

##### References:

[1] | Blyth R.D., J. Algebra 116 pp 506,246– (1988) |

[2] | BellobĂˇs, B. 1986. ”Combinatorics: set systems, hypergraphs, families of vectors, and combinatorial probability”. Cambridge: Cambridge University Press. · Zbl 0595.05001 |

[3] | Curzo M., Proc. Amer. Math. Soc. |

[4] | DOI: 10.1007/BF01229319 · Zbl 0544.20036 |

[5] | Curzio M., Proc. Amer. Math. Soc. (to appear).P. Kim, A. Rhemtulla and H. Smith |

[6] | DOI: 10.1112/jlms/s1-29.2.236 · Zbl 0055.01604 |

[7] | DOI: 10.1017/S1446788700019303 |

This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.