Λ\<-Trees and Their Applications
John W. Morgan
Abstract
To most mathematicians and computer scientists the word ``tree'' conjures up, in addition to the usual image, the image of a connected graph with no circuits. In the last few years various types of trees have been the subject of much investigation, but this activity has not been exposed much to the wider mathematical community. This article attempts to fill this gap and explain various aspects of the recent work on generalized trees. The subject is very appealing for it mixes very na\"ıve geometric considerations with the very sophisticated geometric and algebraic structures. In fact, part of the drama of the subject is guessing what type of techniques will be appropriate for a given investigation: Will it be direct and simple notions related to schematic drawings of trees or will it be notions from the deepest parts of algebraic group theory, ergodic theory, or commutative algebra which must be brought to bear? Part of the beauty of the subject is that the na\"ıve tree considerations have an impact on these more sophisticated topics and that in addition, trees form a bridge between these disparate subjects.
Create a lesson
Related papers
Property R∞ for Artin and Coxeter groups whose outer automorphisms are length-preserving
Ignat Soroko
DL, DQ Spectrum and Eigenvalue-free Interval of Cayley Graphs over Finite Nilpotent Groups
Pallabi Manna, Santanu Mandal
On p-groups with one nonlinear codegree
Jiwei Zheng, Heng Lv
Classes of Subgroups of a finite group with isomorphic quotient groups
Tushar Halder, Sachin Ballal
Cohomology and multiplicative gaps for quasi-isometries of nilpotent groups
Mayukh Mukherjee, Soumyadeb Samanta, Soumyadip Thandar
On the number of conjugacy classes of finite solvable groups of order divisible by p2
Thomas Michael Keller