𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Density of the Commensurability Groups of Uniform Tree Lattices

✍ Scribed by Y.S. Liu

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
499 KB
Volume
165
Category
Article
ISSN
0021-8693

No coin nor oath required. For personal study only.

✦ Synopsis

Let (X) be a universal cover of a finite connected graph, and (\Gamma) a group acting discretely and cocompactly on (X), i.e., a uniform lattice on (X). We announce a proof of the conjecture of H. Bass and R. Kulkarni (J. Amer. Math. Soc. No. 4 (1990), 843-902) that the commensurability group of (\Gamma) is dense in the automorphism group of (X). 1994 Academic Press, Inc.

πŸ“œ SIMILAR VOLUMES

On the uniformity of the closed-set latt
On the uniformity of the closed-set lattice of a tree
✍ K.M. Koh; K.S. Poh πŸ“‚ Article πŸ“… 1986 πŸ› Elsevier Science 🌐 English βš– 578 KB

Denote by e\*(L) and ~,(L) respectively the upper length and lower length of a finite lattice L. The lattice L is said to be uniform if for each integer k with e,(L) < k < Β’\*(L) there exists in L a maximal chain of length k. It is shown that the closed-set lattice of a finite graph G is uniform if

The Strong Independence Theorem for Auto
The Strong Independence Theorem for Automorphism Groups and Congruence Lattices of Arbitrary Lattices
✍ G. GrΓ€tzer; F. Wehrung πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 330 KB

97᎐108 proved a much stronger result, the strong independence of the automorphism group and the congruence lattice in the finite case. In this paper, we provide a full affirmative solution of the above problem. In fact, we prove much stronger results, verifying strong independence for general lattic