1991
DOI: 10.1090/s0894-0347-1991-1096169-1
|View full text |Cite
|
Sign up to set email alerts
|

The boundary of negatively curved groups

Abstract: Every finitely generated group r can be endowed with the word metric d (invariant under left translations) with respect to a given finite generating set.Following Gromov [Gr] we say that r is negatively curved provided there exists a (large) number t5 such thatfor all x, y, Z E r. Here (x· y) stands for the "overlap function"Gromov's article [Gr] When r has torsion, we can construct a highly connected polyhedron with free and cocompact r-action. For integers d and m, let P(d, m, f) be the subcomplex of the… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

5
241
0
2

Year Published

2001
2001
2022
2022

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 220 publications
(250 citation statements)
references
References 13 publications
(1 reference statement)
5
241
0
2
Order By: Relevance
“…More generally, virtually polycyclic groups satisfy these conditions, since we can also take R n for some n to be our universal space [Wil00]. Gromov's word hyperbolic groups also satisfy the conditions by taking a certain compactification of the Rips complex [BM91,MS02].…”
Section: The Main Theoremmentioning
confidence: 99%
“…More generally, virtually polycyclic groups satisfy these conditions, since we can also take R n for some n to be our universal space [Wil00]. Gromov's word hyperbolic groups also satisfy the conditions by taking a certain compactification of the Rips complex [BM91,MS02].…”
Section: The Main Theoremmentioning
confidence: 99%
“…condition of Bestvina and Mess [1], which can be used, if the boundary has no cut points, to discover whether it is connected (Proposition 5.1). Finally, in Section 5 we present the algorithms which prove Theorems 1.2, 1.3 and 1.4.…”
Section: Theorem 12 There Exists An Algorithm Which Takes As Input mentioning
confidence: 99%
“…The first two types are called horizontal, and the last type is called vertical. • H (2) contains three kinds of 2-cells: (1) If γ ⊂ H (1) is a circuit composed of three horizontal edges, then there is a 2-cell (a horizontal triangle) attached along γ.…”
Section: Definition 21 Let γ Be Any 1-complex the Combinatorial Homentioning
confidence: 99%
See 2 more Smart Citations