Small cancellation groups and translation numbers

DOI10.1090/S0002-9947-97-01653-XzbMATH Open0885.20023arXivmath/9611203MaRDI QIDQ4336544FDOQ4336544

Authors: Ilya Kapovich 

Publication date: 13 May 1997

Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)

Abstract: In this paper we prove that C(4)-T(4)-P, C(3)-T(6)-P and C(6)-P small cancellation groups are translation dis crete in the strongest possible sense and 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. There is also an algorithm for calculating for each $g$ the maximum $n$ such that $g$ is an $n$-th power of some element. We also note that these groups cannot contain isomorphic copies of the gr oup of $p$-adic fractions and so in particular of the group of rational numbers. Besides we show that for C(4)-T(4) and C(3)-T(6) groups all translation numbers are rational and have bounded denominators.

Full work available at URL: https://arxiv.org/abs/math/9611203

Recommendations

• Translation numbers in groups with the condition \(C(4)\&T(4)\).
• Translation numbers in negatively curved groups
• Translation numbers in a Garside group are rational with uniformly bounded denominators.
• Discreteness properties of translation numbers in solvable groups

zbMATH Keywords

algorithmsequations over groupssmall cancellation groupsfinite generating setstranslation numbers

Mathematics Subject Classification ID

Geometric group theory (20F65) Cancellation theory of groups; application of van Kampen diagrams (20F06) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Small cancellation theory and automatic groups. II
• Artin groups and infinite Coxeter groups
• Manifolds of nonpositive curvature
• Automatic groups and amalgams
• Small cancellation theory and automatic groups
• Title not available (Why is that?)
• TWO AUTOMATIC SPANNING TREES IN SMALL CANCELLATION GROUP PRESENTATIONS
• Rational subgroups of biautomatic groups
• Polygonal complexes and combinatorial group theory
• The Word and Conjugacy Problems for the Knot Group of any Tame, Prime, Alternating Knot
• OnT(6)-groups
• Powers and conjugacy in small cancellation groups
• The conjugacy problem for free products of sixth-groups with cyclic amalgamation
• Title not available (Why is that?)
• Title not available (Why is that?)
• On Greendlinger groups

Cited In (10)

• Title not available (Why is that?)
• Garside groups are strongly translation discrete.
• Discreteness properties of translation numbers in solvable groups
• Counting conjugacy classes in groups with contracting elements
• Švarc–Milnor quasi-isometries for Fuchsian groups
• Braid groups of imprimitive complex reflection groups.
• A NEW PROOF THAT ALTERNATING LINKS ARE NON-TRIVIAL
• Translation numbers in a Garside group are rational with uniformly bounded denominators.
• Translation numbers in groups with the condition \(C(4)\&T(4)\).
• Negative curvature in graphical small cancellation groups

This page was built for publication: Small cancellation groups and translation numbers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4336544)