Counting overlattices in automorphism groups of trees

Details Counting overlattices in automorphism groups of trees Counting overlattices in automorphism groups of trees

2005-06-11

arxiv.org/abs/math/0506217v1

Mathematics

Group Theory

16 pages, to appear in Geom. Dedicata

Scientific paper

We give an upper bound for the number of ``overlattices'' in the automorphism
group of a tree, containing a fixed lattice with index n. For an example of a
lattice in the automorphism group of a 2p-regular tree whose quotient is a
loop, we obtain a lower bound of the asymptotic behavior as well.

Affiliated with

Also associated with

No associations

Rating

Counting overlattices in automorphism groups of trees does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Counting overlattices in automorphism groups of trees, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Counting overlattices in automorphism groups of trees will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-666666