Search arXiv⌕ Search

arXiv · math/0010136

Quasi-actions on trees I. Bounded valence

Abstract

Given a bounded valence, bushy tree T, we prove that any cobounded quasi-action of a group G on T is quasiconjugate to an action of G on another bounded valence, bushy tree T'. This theorem has many applications: quasi-isometric rigidity for fundamental groups of finite, bushy graphs of coarse PD(n) groups for each fixed n; a generalization to actions on Cantor sets of Sullivan's Theorem about uniformly quasiconformal actions on the 2-sphere; and a characterization of locally compact topological groups which contain a virtually free group as a cocompact lattice. Finally, we give the first examples of two finitely generated groups which are quasi-isometric and yet which cannot act on the same proper geodesic metric space, properly discontinuously and cocompactly by isometries.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Lee Mosher, Michah Sageev, Kevin Whyte. 2004-02-23. Quasi-actions on trees I. Bounded valence. https://arxiv.org/abs/math/0010136

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Strongly Regular Graphs of Rank Four

Strongly regular graphs are regular graphs with a constant number of common neighbours between adjacent vertices, and a constant number of common neighbours between non-adjacent vertices. These graphs have been of great interest over the last few decades and often give rise to interesting groups of automorphisms. In this paper we take a reverse approach, and leverage strong classification results on rank four permutation groups to classify the strongly regular graphs which yield such groups as a group of automorphisms.

math.GR↗

Every finite group admits a just finite presentation

A finite presentation < X | R > of a finite group is called `just finite' if removing any relation from R results in a presentation for an infinite group. It has been an open question (Kourovka Notebook, Problem 21.10) whether every finite group admits such a presentation. We resolve this conjecture in the affirmative.

math.GR↗

Assouad--Nagata dimension of systolic complexes with almost flat intervals

We introduce the notion of systolic complexes with almost flat intervals. They constitute a subclass of fit systolic complexes and arise naturally in the study of graphical C(3)--T(6) small cancellation complexes. We prove that their Assouad--Nagata dimension is bounded above by a universal constant. As consequences, we obtain universal bounds on the Assouad--Nagata dimension of tame simply connected graphical C(3)--T(6) small cancellation complexes and of finitely generated groups defined by graphical C(3)--T(6) small cancellation presentations. In the appendix, we observe that the proof of finiteness of asymptotic dimension for buildings due to Dymara and Schick also yields finiteness of their asymptotic Assouad--Nagata dimension.

math.GR↗