A Lattice Point Problem on the Regular Tree
Combinatorics
2010-02-05 v1
Abstract
Heinz Huber (1956) considered the following problem on the the hyperbolic plane H. Consider a strictly hyperbolic subgroup of automorphisms on H with compact quotient, and choose a conjugacy class in this group. Count the number of vertices inside an increasing ball, which are images of a fixed point x in H under automorphisms in the chosen conjugacy class, and describe the asymptotic behaviour of this number as the size of the ball goes to infinity. We use a well-known analogy between the hyperbolic plane and the regular tree to solve this problem on the regular tree.
Cite
@article{arxiv.1002.0932,
title = {A Lattice Point Problem on the Regular Tree},
author = {Femke Douma},
journal= {arXiv preprint arXiv:1002.0932},
year = {2010}
}
Comments
10 pages, 1 figure