Abstract
It is given a full description of conjugacy classes in the automorphism group of the locally finite tree and of a rooted tree. They are characterized by their types (a labeled rooted trees) similar to the cyclical types of permutations. We discuss separately the case of a level homogenous tree, i.e. conjugality in wreath products of infinite sequences of symmetric groups. It is proved those automorphism groups of rooted and homogenous non-rooted trees are ambivalent.
| Original language | English |
|---|---|
| Pages (from-to) | 529-547 |
| Number of pages | 19 |
| Journal | International Journal of Algebra and Computation |
| Volume | 11 |
| Issue number | 5 |
| DOIs | |
| Publication status | Published - 2001 |
ASJC Scopus subject areas
- General Mathematics
Fingerprint
Dive into the research topics of 'Conjugation in tree automorphism groups'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver