Counting overlattices in automorphism groups of trees

Simple item page
dc.creatorLim, Seonhee
dc.date2005-06-11
dc.date.accessioned2026-07-07T05:20:40Z
dc.date.available2026-07-07T05:20:40Z
dc.descriptionWe 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.
dc.description16 pages, to appear in Geom. Dedicata
dc.identifierhttps://arxiv.org/abs/math/0506217
dc.identifierhttp://arxiv.org/abs/math/0506217
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/75462
dc.subjectGroup Theory
dc.titleCounting overlattices in automorphism groups of trees
dc.typetext

Files

Collections

arXiv