Maximally symmetric trees
Group Theory
2007-05-23 v2
Abstract
We characterize the ``best'' model geometries for the class of virtually free groups, and we show that there is a countable infinity of distinct ``best'' model geometries in an appropriate sense--these are the maximally symmetric trees. The first theorem gives several equivalent conditions on a bounded valence, cocompact tree T without valence 1 vertices saying that T is maximally symmetric. The second theorem gives general constructions for maximally symmetric trees, showing for instance that every virtually free group has a maximally symmetric tree for a model geometry.
Keywords
Cite
@article{arxiv.math/0012004,
title = {Maximally symmetric trees},
author = {Lee Mosher and Michah Sageev and Kevin Whyte},
journal= {arXiv preprint arXiv:math/0012004},
year = {2007}
}
Comments
37 pages. A minor revision, correcting a few typos, grammar errors, and omissions