Cargando…
The Reconstruction of Trees from Their Automorphism Groups.
Trees, sometimes called semilinear orders, are partially ordered sets in which every initial segment determined by an element is linearly ordered. This book focuses on automorphism groups of trees, providing a nearly complete analysis of when two trees have isomorphic automorphism groups. Special at...
| Clasificación: | Libro Electrónico |
|---|---|
| Autor principal: | |
| Formato: | Electrónico eBook |
| Idioma: | Inglés |
| Publicado: |
Providence :
American Mathematical Society,
1993.
|
| Colección: | Contemporary Mathematics Ser.
|
| Temas: | |
| Acceso en línea: | Texto completo |
Tabla de Contenidos:
- Intro; Contents; Summary; 0. An extended introduction; 1. Some preliminaries concerning interpretations, groupsand N0 -categoricity; 2. A new reconstruction theorem for Boolean algebras; 3. The completion and the Boolean algebra of a U-tree; 4. The statement of the canonization and reconstruction theorems; 5. The canonization of trees; 6. The reconstruction of the Boolean algebra of a U-tree; 7. The reconstruction of PT(Exp(M)); 8. Final reconstruction results; 9. Observations, examples and discussion; 10. Augmented trees; 11. The reconstruction of N0-categorical trees.
- 12. Nonisomorphic 1-homogeneous chains which have isomorphic automorphism groupsBibliography; A list of notations and definitions.