Remote Access Proceedings of the American Mathematical Society
Green Open Access

Proceedings of the American Mathematical Society

ISSN 1088-6826(online) ISSN 0002-9939(print)

 

 

Representation of tree permutations by words


Author: John A. Maroli
Journal: Proc. Amer. Math. Soc. 110 (1990), 859-869
MSC: Primary 06A06; Secondary 06F15, 20B27
DOI: https://doi.org/10.1090/S0002-9939-1990-1037214-X
MathSciNet review: 1037214
Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

Abstract: The problem of solving equations in groups can be stated as follows: given a group $ G$ and a free group $ F = F\left( {{x_1},{x_2}, \ldots } \right)$, for which pairs $ \left( {w,g} \right)$ with $ w = w\left( {{x_1},{x_2}, \ldots } \right) \in F,g \in G$, is it possible to find elements $ {g_i} \in G$ such that $ w\left( {{g_1},{g_2}, \ldots } \right) = g$? We investigate the corresponding question of solving equations in the group $ A\left( \Omega \right)$ of all automorphisms of a transitive tree $ \Omega $. If the tree has isomorphic cones at a branch point, then certain equations of the form $ {x^n} = g$ cannot be solved (Theorem 2.3). If the tree is sufficiently transitive, we find large classes of equations $ w = g$ which can be solved (Theorems 2.13, 2.16).


References [Enhancements On Off] (What's this?)


Similar Articles

Retrieve articles in Proceedings of the American Mathematical Society with MSC: 06A06, 06F15, 20B27

Retrieve articles in all journals with MSC: 06A06, 06F15, 20B27


Additional Information

DOI: https://doi.org/10.1090/S0002-9939-1990-1037214-X
Article copyright: © Copyright 1990 American Mathematical Society