Suche einschränken:
Zur Kasse

Tree Lattices

Group actions on trees furnish a unified geometric way of recasting the chapter of combinatorial group theory dealing with free groups, amalgams, and HNN extensions. Some of the principal examples arise from rank one simple Lie groups over a non-archimedean local field acting on their Bruhat—Tits trees. In particular this leads to a powerful method for studying lattices in such Lie groups.
This monograph extends this approach to the more general investigation of X-lattices G, where X-is a locally finite tree and G is a discrete group of automorphisms of X of finite covolume. These "tree lattices" are the main object of study. Special attention is given to both parallels and contrasts with the case of Lie groups. Beyond the Lie group connection, the theory has application to combinatorics and number theory.
The authors present a coherent survey of the results on uniform tree lattices, and a (previously unpublished) development of the theory of non-uniform tree lattices, including some fundamental and recently proved existence theorems. Non-uniform tree lattices are much more complicated than uniform ones, thus a good deal of attention is given to the construction and study of diverse examples. The fundamental technique is the encoding of tree action in terms of the corresponding quotient "graphs of groups."
Tree Lattices should be a helpful resource to researcher sin the field, and may also be used for a graduate course on geometric methods in group theory.

CHF 110.00

Lieferbar

ISBN 9780817641207
Sprache eng
Cover C, geometry, Discrete Mathematics, Group Theory and Generalizations, Order, Lattices, Ordered Algebraic Structures, Topological Groups, Lie Groups, Combinatorics, Topological Groups and Lie Groups, Mathematics and Statistics, Group Theory, Algebra, Ordered algebraic structures, Topological groups, Lie groups, Groups & group theory, Combinatorics & graph theory, Fester Einband
Verlag Springer Nature EN
Jahr 2000

Kundenbewertungen

Dieser Artikel hat noch keine Bewertungen.