A bound for groups of linear growth (Q1070340): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf01189278 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1992627633 / rank | |||
Normal rank | |||
Latest revision as of 08:45, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A bound for groups of linear growth |
scientific article |
Statements
A bound for groups of linear growth (English)
0 references
1987
0 references
Let G be a finitely generated group and let f(n) be the number of elements which can be represented by words of length \(\leq n\) in the generators or their inverses. Suppose G is infinite, \(k>0\), and f(k)-f(k- 1)\(\leq k\). Set \(c=f(k)-f(k-1)\). It is shown that G has a subgroup isomorphic to \({\mathbb{Z}}\) of index \(\leq c\) and that this bound is sharp.
0 references
finitely generated group
0 references
cyclic subgroup of finite index
0 references
0 references
