Small cancellation groups and translation numbers (Q4336544)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1008780
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Small cancellation groups and translation numbers |
scientific article; zbMATH DE number 1008780 |
Statements
Small cancellation groups and translation numbers (English)
0 references
13 May 1997
0 references
equations over groups
0 references
finite generating sets
0 references
small cancellation groups
0 references
algorithms
0 references
translation numbers
0 references
0.86504065990448
0 references
0.7852704524993896
0 references
0.783707320690155
0 references
0.780421793460846
0 references
Let \(G\) be a group and \(X\) a finite generating set. For \(g\in G\) let \(l_X(G)\) be the length of \(g\) with respect to \(X\). The translation number \(\tau_X(g)\) of \(g\) with respect to \(X\) is defined as \(\lim_{n\to\infty} l_X(g^n)/n\). The group \(G\) is called strongly translation discrete if, roughly speaking, \(\tau_X(G)\) is a discrete subset of the reals for any finite generating set \(X\). The author shows, using the theory of CAT(0)-spaces, that \(C(4)\)-\(T(4)\)-\(P\), \(C(3)\)-\(T(6)\)-\(P\) and \(C(6)\)-\(P\) small cancellation groups are strongly translation discrete. It is also shown that in these groups for any \(g\) and any \(n\) there is an algorithm deciding whether or not the equation \(x^n=g\) has a solution. The author also notes that these groups cannot contain copies of the group of \(p\)-adic fractions and so in particular of the group of rational numbers. In addition it is shown that, just as in the hyperbolic case, for \(C''(4)\)-\(T(4)\) and \(C''(3)\)-\(T(6)\) groups all translation numbers are rational and have bounded denominators.
0 references