2018
DOI: 10.1017/s0305004118000440
|View full text |Cite
|
Sign up to set email alerts
|

Growth of quasiconvex subgroups

Abstract: We prove that non-elementary hyperbolic groups grow exponentially more quickly than their infinite index quasiconvex subgroups. The proof uses the classical tools of automatic structures and Perron–Frobenius theory.We also extend the main result to relatively hyperbolic groups and cubulated groups. These extensions use the notion of growth tightness and the work of Dahmani, Guirardel and Osin on rotating families.

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

1
33
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 14 publications
(34 citation statements)
references
References 36 publications
1
33
0
Order By: Relevance
“…In Section 3.3, similarly to [DFW16], we produce a left eigenvector of the transition matrix of the shortlex machine, with eigenvalue λ, whose support consists of states with "maximal growth"-that is, states whose number of n-th successors grows at the same rate as the group itself. In Section 6, we confirm that such states are dense in every shortlex shelling.…”
Section: Populated Shellingsmentioning
confidence: 99%
See 2 more Smart Citations
“…In Section 3.3, similarly to [DFW16], we produce a left eigenvector of the transition matrix of the shortlex machine, with eigenvalue λ, whose support consists of states with "maximal growth"-that is, states whose number of n-th successors grows at the same rate as the group itself. In Section 6, we confirm that such states are dense in every shortlex shelling.…”
Section: Populated Shellingsmentioning
confidence: 99%
“…A remarkable fact about hyperbolic groups is that the language of shortlex geodesics is regular-we recall the relevant definitions here. For a detailed discussion see, for example, [ECH + 92], [CF10], and [DFW16] Definition 3.14. A finite state automaton (FSA) on alphabet S (where here S is an arbitrary finite set) is a directed graph whose edges are labeled by elements of S (for a formal definition see, for example, [GJ02]).…”
Section: Set Upmentioning
confidence: 99%
See 1 more Smart Citation
“…However, he also proved in [17] that the π 1 of a closed hyperbolic 3-manifold contains a free subgroup with critical exponent arbitrarily close to 2. Let us close this discussion by mentioning a very recent result of Dahmani, Futer and Wise [26] that for free groups F n (n ≥ 2) there exists a sequence of finitely generated subgroups with critical exponents tending to log(2n−1). Hence, an intriguing question arises concerning the conditions under which there exists a gap of critical exponents for free subgroups of ambient groups.…”
mentioning
confidence: 99%
“…For finitely-generated abelian groups, it is possible that the number of locally restricted compositions of a is asymptotically independent of a but it is no longer possible for each total a to be asymptotically equally likely since the group is infinite. The recent paper [20] explores other problems involving finitely-generated groups and enumeration.…”
Section: Resultsmentioning
confidence: 99%