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 text focuses on automorphism groups of trees, providing a nearly complete analysis of when two trees have isomorphic automorphism groups. Special attention is paid to the class of N 0-categorical trees. Various open problems, mostly in permutation group theory and in model theory, are discussed, and a number of research directions are indicated. No index. Annotation copyright Book News, Inc. Portland, Or.