Let X be a totally ordered set and consider the semigroups of orderdecreasing (increasing) full (partial, partial one-to-one) transformations of X. In this Thesis the study of order-increasing full (partial, partial one-to-one) transformations has been reduced to that of order-decreasing full (partial, partial one-to-one) transformations and the study of order-decreasing partial transformations to that of order-decreasing full transformations for both the finite and infinite cases. For the finite order-decreasing full (partial one-to-one) transformation semigroups, we obtain results analogous to Howie (1971) and Howie and McFadden (1990) concerning products of idempotents (quasi-idempotents), and concerning combinatorial and rank properties. By contrast with the semigroups of order-preserving transformations and the full transformation semigroup, the semigroups of orderdecreasing full (partial one-to-one) transformations and their Rees quotient semigroups are not regular. They are, however, abundant (type A) semigroups in the sense of Fountain (1982,1979). An explicit characterisation of the minimum semilattice congruence on the finite semigroups of order-decreasing transformations and their Rees quotient semigroups is obtained. If X is an infinite chain then the semigroup S of order-decreasing full transformations need not be abundant. A necessary and sufficient condition on X is obtained for S to be abundant. By contrast, for every chain X the semigroup of order-decreasing partial one-to-one transformations is type A. The ranks of the nilpotent subsemigroups of the finite semigroups of orderdecreasing full (partial one-to-one) transformations have been investigated.

Thesis (Ph.D.)--University of Nebraska-Lincoln, 2006. / Title from title screen (site viewed on Feb. 6, 2007). PDF text: iv, 86 p. : ill. UMI publication number: AAT 3218333. Includes bibliographical references. Also available in microfilm and microfiche format.

Thesis (Ph. D. in Mathematics)--Vanderbilt University, Aug. 2006. / Title from title screen. Includes bibliographical references.

No description available.

This study examines subjective occupational status and what factors influence and indicate subjective occupational status among employees in the municipal sector. The study also investigates if subjective occupational status has any significant connections with stress and worrying. The aim of this study is to examine if income, education, age, gender and length of employment has any significant effect on the subjective occupational status. We also aim to investigate if subjective occupational status affects the respondent’s levels of stress and worry. The material for the study was collected via a questionnaire with 268 respondents. The survey was done via the internet and sent out to the respondents via e-mail. We are utilizing the reference group theory in our analysis of the material. Reference group theory states that subjective social position is created by social comparison. Individuals tend to base their position in the social hierarchy and compare themselves with individuals who are similar to them. This leads to that many people places themselves as average. The results of the study show that it is only income which is affecting the subjective occupational status. We also found that subjective occupational status does not have any connections with stress apart from causing the respondents some worry over not having time to complete their work assignments.

We define a strong form of subgroup separability, which we call RS separability, and we use this to combine LERF and Agol’s RFRS condition on groups into a property called LVRSS. We show that some infinite classes of groups that are known to be both subgroup separable and virtually RFRS are also LVRSS. We also provide evidence for the naturalness of RS separability and LVRSS by showing that they are preserved under various operations on groups. / text

The focus of this thesis is finitely generated subgroups of the automorphism group of an infinite spherically homogeneous rooted tree (regular or irregular). The first chapter introduces the topic and outlines the main results. The second chapter provides definitions of the terminology used, and also some preliminary results. The third chapter introduces a group that appears to be a promising candidate for a finitely generated group of infinite upper rank with finite upper $p$-rank for all primes $p$. It goes on to demonstrate that in fact this group has infinite upper $p$-rank for all primes $p$. As a by-product of this construction, we obtain a finitely generated branch group with quotients that are virtually-(free abelian of rank $n$) for arbitrarily large $n$. The fourth chapter gives a complete classification of ternary automata with $C_2$-action at the root, and a partial classification of ternary automata with $C_3$-action at the root. The concept of a `windmill automaton' is introduced in this chapter, and a complete classification of binary windmill automata is given. The fifth chapter contains a detailed study of the non-abelian ternary automata with $C_3$-action at the root. It also contains some conjectures about possible isomorphisms between these groups.

Part I of this thesis presents methods for finding the primitive permutation groups of degree d, where 2500 ≤ d < 4096, using the O'Nan-Scott Theorem and Aschbacher's theorem. Tables of the groups G are given for each O'Nan-Scott class. For the non-affine groups, additional information is given: the degree d of G, the shape of a stabiliser in G of the primitive action, the shape of the normaliser N in S[subscript(d)] of G and the rank of N. Part II presents a new algorithm NormaliserGL for computing the normaliser in GL[subscript(n)](q) of a group G ≤ GL[subscript(n)](q). The algorithm is implemented in the computational algebra system MAGMA and employs Aschbacher's theorem to break the problem into several cases. The attached CD contains the code for the algorithm as well as several test cases which demonstrate the improvement over MAGMA's existing algorithm.

In this thesis we consider in detail the following two fundamental problems for semigroup presentations: 1. Given a semigroup find a presentation defining it. 2. Given a presentation describe the semigroup defined by it. We also establish two links between these two approaches: semigroup constructions and computational methods. After an introduction to semigroup presentations in Chapter 3, in Chapters 4 and 5 we consider the first of the two approaches. The semigroups we examine in these two chapters include completely O-simple semigroups, transformation semigroups, matrix semigroups and various endomorphism semigroups. In Chapter 6 we find presentations for the following semi group constructions: wreath product, Bruck-Reilly extension, Schiitzenberger product, strong semilattices of monoids, Rees matrix semigroups, ideal extensions and subsemigroups. We investigate in more detail presentations for subsemigroups in Chapters 7 and 10, where we prove a number of Reidemeister-Schreier type results for semigroups. In Chapter 9 we examine the connection between the semi group and the group defined by the same presentation. The general results from Chapters 6, 7, 9 and 10 are applied in Chapters 8, 11, 12 and 13 to subsemigroups of free semigroups, Fibonacci semigroups, semigroups defined by Coxeter type presentations and one relator products of cyclic groups. Finally, in Chapter 14 we describe the Todd-Coxeter enumeration procedure and introduce three modifications of this procedure.

For various values of n and m we investigate homomorphisms from Out(F_n) to Out(F_m) and from Out(F_n) to GL_m(K), i.e. the free and linear representations of Out(F_n) respectively. By means of a series of arguments revolving around the representation theory of finite symmetric subgroups of Out(F_n) we prove that each homomorphism from Out(F_n) to GL_m(K) factors through the natural map p_n from Out(F_n) to GL(H_1(F_n,Z)) = GL_n(Z) whenever n=3, m < 7 and char(K) is not an element of {2,3}, and whenever n>5, m< n(n+1)/2 and char(K) is not an element of {2,3,...,n+1}. We also construct a new infinite family of linear representations of Out(F_n) (where n > 2), which do not factor through p_n. When n is odd these have the smallest dimension among all known representations of Out(F_n) with this property. Using the above results we establish that the image of every homomorphism from Out(F_n) to Out(F_m) is finite whenever n=3 and n < m < 6, and of cardinality at most 2 whenever n > 5 and n < m < n(n-1)/2. We further show that the image is finite when n(n-1)/2 -1 < m < n(n+1)/2. We also consider the structure of normal finite index subgroups of Out(F_n). If N is such then we prove that if the derived subgroup of the intersection of N with the Torelli subgroup T_n < Out(F_n) contains some term of the lower central series of T_n then the abelianisation of N is finite.