2016
DOI: 10.1090/tran/6701
|View full text |Cite
|
Sign up to set email alerts
|

Finite generating sets of relatively hyperbolic groups and applications to geodesic languages

Abstract: Abstract. Given a finitely generated relatively hyperbolic group G, we construct a finite generating set X of G such that (G, X) has the 'falsification by fellow traveler property' provided that the parabolic subgroups {Hω}ω∈Ω have this property with respect to the generating sets {X ∩ Hω}ω∈Ω. This implies that groups hyperbolic relative to virtually abelian subgroups, which include all limit groups and groups acting freely on R n -trees, or geometrically finite hyperbolic groups, have generating sets for whic… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2

Citation Types

2
66
0

Year Published

2017
2017
2023
2023

Publication Types

Select...
4
2

Relationship

1
5

Authors

Journals

citations
Cited by 22 publications
(68 citation statements)
references
References 37 publications
2
66
0
Order By: Relevance
“…Background and details on relatively hyperbolic groups used in this paper can be found in [25,13,20,1].…”
Section: Relatively Hyperbolic Groupsmentioning
confidence: 99%
See 2 more Smart Citations
“…Background and details on relatively hyperbolic groups used in this paper can be found in [25,13,20,1].…”
Section: Relatively Hyperbolic Groupsmentioning
confidence: 99%
“…Antolin and Ciobanu studied geodesics and language theoretic properties of relatively hyperbolic groups in [1]. For example, they show that every finitely generated relatively hyperbolic group has a finite generating set, A, such that each Γ A∩H j (H j ) isometrically embeds in Γ A (G) [1, Lemma 5.3] (in fact every finite generating set can be extended to one with this property).…”
Section: Relatively Hyperbolic Groupsmentioning
confidence: 99%
See 1 more Smart Citation
“…This article is structured as follows. In Section 2, we summarise the basic properties of relatively hyperbolic groups that we shall need, and we recall some of their properties that are proved in [3]. In Section 3, we introduce the concept of extended Dehn algorithms for solving the word and generalised word problems in groups and we recall some results pertaining to relatively hyperbolic groups that are proved in [9].…”
Section: Introductionmentioning
confidence: 99%
“…We shall need to use two more properties of relatively hyperbolic groups that are proved in [3]. Now suppose that v is any word in X * .…”
mentioning
confidence: 99%