Search arXivSearch

arXiv · math/9201265

$\Lambda$\<-Trees and Their Applications

Abstract

To most mathematicians and computer scientists the word ``tree'' conjures up, in addition to the usual image, the image of a connected graph with no circuits. In the last few years various types of trees have been the subject of much investigation, but this activity has not been exposed much to the wider mathematical community. This article attempts to fill this gap and explain various aspects of the recent work on generalized trees. The subject is very appealing for it mixes very na\"{\i}ve geometric considerations with the very sophisticated geometric and algebraic structures. In fact, part of the drama of the subject is guessing what type of techniques will be appropriate for a given investigation: Will it be direct and simple notions related to schematic drawings of trees or will it be notions from the deepest parts of algebraic group theory, ergodic theory, or commutative algebra which must be brought to bear? Part of the beauty of the subject is that the na\"{\i}ve tree considerations have an impact on these more sophisticated topics and that in addition, trees form a bridge between these disparate subjects.

Explore related subjects

Keep this discovery

BibTeXRIS

John W. Morgan. 1992-01-01. $\Lambda$\<-Trees and Their Applications. https://arxiv.org/abs/math/9201265

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

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR