No description available.

Thesis (M. Sc.)--Carleton University, 2004. / Includes bibliographical references (p. 56-57). Also available in electronic format on the Internet.

No description available.

No description available.

No description available.

In this thesis we consider in detail the following two problems for semigroups: (i) When are semigroups finitely generated and presented? (ii) Which families of semigroups can be efficiently presented? We also consider some other finiteness conditions for semigroups, homology of semigroups and wreath product of groups. In Chapter 2 we investigate finite presentability and some other finiteness conditions for the O-direct union of semigroups with zero. In Chapter 3 we investigate finite generation and presentability of Rees matrix semigroups over semigroups. We find necessary and sufficient conditions for finite generation and presentability. In Chapter 4 we investigate some other finiteness conditions for Rees matrix semigroups. In Chapter 5 we consider groups as semigroups and investigate their semigroup efficiency. In Chapter 6 we look at "proper" semigroups, that is semigroups that are not groups. We first give examples of efficient and inefficient "proper" semigroups by computing their homology and finding their minimal presentations. In Chapter 7 we compute the second homology of finite simple semigroups and find a "small" presentation for them. If that "small" presentation has a special relation, we prove that finite simple semigroups are efficient. Finally, in Chapter 8, we investigate the efficiency of wreath products of finite groups as groups and as semigroups. We give more examples of efficient groups and inefficient groups.

Thesis (Ph.D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 1979. / MICROFICHE COPY AVAILABLE IN ARCHIVES AND SCIENCE. / Vita. / Bibliography: leaves 163-165. / Ph.D.

We construct an algorithm for getting a reduced expression for any element in a complex reflection group G(m, 1, r) by sorting the element, which is in the form of a sequence of complex numbers, to the identity. Thus, the algorithm provides us a set of reduced expressions, one for each element. We establish a one-one correspondence between the set of all reduced expressions for an element and a set of certain sorting sequences which turn the element to the identity. In particular, this provides us with a combinatorial method to check whether an expression is reduced. We also prove analogues of the exchange condition and the strong exchange condition for elements in a G(m, 1, r). A Bruhat order on the groups is also defined and investigated. We generalize the Geck-Pfeiffer reducibility theorem for finite Coxeter groups to the groups G(m, 1, r). Based on this, we prove that a character value of any element in an Ariki-Koike algebra (the Hecke algebra of a G(m, 1, r)) can be determined by the character values of some special elements in the algebra. These special elements correspond to the reduced expressions, which are constructed by the algorithm, for some special conjugacy class representatives of minimal length, one in each class. Quasi-parabolic subgroups are introduced for investigating representations of Ariki- Koike algebras. We use n x n arrays of non-negative integer sequences to characterize double cosets of quasi-parabolic subgroups. We define an analogue of permutation modules, for Ariki-Koike algebras, corresponding to certain subgroups indexed by multicompositions. These subgroups are naturally corresponding, not necessarily one-one, to quasi-parabolic subgroups. We prove that each of these modules is free and has a basis indexed by right cosets of the corresponding quasi-parabolic subgroup. We also construct Murphy type bases, Specht series for these modules, and establish a Young's rule in this case.

Thesis (Ph. D.)--University of Chicago, Department of Mathematics, August 2003. / Includes bibliographical references. Also available on the Internet.

The purpose of this thesis is to discuss the rôle of certain types of quiver which appear in the modular representation theory of finite groups. It is our concern to study two different types of quiver. First of all we construct the ordinary quiver of certain blocks of defect 2 of the symmetric group, and then apply our results to the alternating group and to the theory of partitions. Secondly, we consider connected components of the stable Auslander-Reiten quiver of certain groups G with normal subgroup N. The main interest lies in comparing the tree class of components of N-modules, with the tree class of components of these modules induced up to G.