Counting overlattices in automorphism groups of trees. (Q2498408): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2061318913 / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: math/0506217 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Covering theory for graphs of groups / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4720067 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Uniform Tree Lattices / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Tree lattices. With appendices by H. Bass, L. Carbone, A. Lubotzky, G. Rosenberg, and J. Tits. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Infinite towers of tree lattices / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Automorphisms of trivalent graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4865979 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4891333 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A bound on the number of generators of a finite group / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Enumerating finite groups of given order / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5669004 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4055870 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Enumerating <i>p</i> -Groups / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3712472 / rank | |||
Normal rank |
Latest revision as of 18:11, 24 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Counting overlattices in automorphism groups of trees. |
scientific article |
Statements
Counting overlattices in automorphism groups of trees. (English)
0 references
16 August 2006
0 references
The Kazhdan-Margulis Lemma says that there exists a positive lower bound for the covolume of co-compact lattices in connected semi-simple Lie groups. This is no longer true in the case of lattices in the group of automorphisms of a locally finite tree. In this case there are examples of infinite increasing sequences of lattices whose co-volume tends to \(0\). However for a co-compact lattice \(\Gamma\) in the group \(\Aut(T)\) of automorphisms of a locally finite tree \(T\), there is only a finite number \(u_\Gamma(n)\) of lattices \(\Gamma'\) containing \(\Gamma\) as a subgroup of a fixed index \(n\). Thus it is natural to ask what is the asymptotic behavior of \(u_\Gamma(n)\) as \(n\) tends to \(\infty\). This question was first raised by Bass and Lubotzky. The paper under review contains two results: it provides an upper bound of \(u_\Gamma(n)\) for any co-compact lattice \(\Gamma\) in \(\Aut(T)\), and it computes a lower bound of \(u_\Gamma(n)\) for a specific lattice in the automorphism group of a \(2p\)-regular tree.
0 references
groups acting on trees
0 references
graphs of groups
0 references
automorphism groups of locally finite trees
0 references
numbers of lattices
0 references
subgroups of finite index
0 references
0 references