Not available / text

Please refer to the thesis for the abstract. / Thesis (Ph.D.)-University of Natal, Durban, 1998.

The aim of this dissertation is to describe the conjugacy classes and some of the ordinary irreducible characters of the nite general linear group GL(n, q); together with character tables of some of its subgroups. We study the structure of GL(n, q) and some of its important subgroups such as SL(n, q); UT(n, q); SUT(n, q); Z(GL(n, q)); Z(SL(n, q)); GL(n, q)0 ; SL(n, q)0 ; the Weyl group W and parabolic subgroups P : In addition, we also discuss the groups PGL(n, q); PSL(n, q) and the a ne group A (n, q); which are related to GL(n, q): The character tables of GL(2; q); SL(2; q); SUT(2; q) and UT(2; q) are constructed in this dissertation and examples in each case for q = 3 and q = 4 are supplied. A complete description for the conjugacy classes of GL(n, q) is given, where the theories of irreducible polynomials and partitions of i 2 f1; 2; ; ng form the atoms from where each conjugacy class of GL(n, q) is constructed. We give a special attention to some elements of GL(n, q); known as regular semisimple, where we count the number and orders of these elements. As an example we compute the conjugacy classes of GL(3; q): Characters of GL(n, q) appear in two series namely, principal and discrete series characters. The process of the parabolic induction is used to construct a large number of irreducible characters of GL(n, q) from characters of GL(n, q) for m < n: We study some particular characters such as Steinberg characters and cuspidal characters (characters of the discrete series). The latter ones are of particular interest since they form the atoms from where each character of GL(n, q) is constructed. These characters are parameterized in terms of the Galois orbits of non-decomposable characters of F q n: The values of the cuspidal characters on classes of GL(n, q) will be computed. We describe and list the full character table of GL(n, q): There exists a duality between the irreducible characters and conjugacy classes of GL(n, q); that is to each irreducible character, one can associate a conjugacy class of GL(n, q): Some aspects of this duality will be mentioned. / Thesis (M.Sc. (School of Mathematical Sciences)) - University of KwaZulu-Natal, Pietermaritzburg, 2008.

Let F be a finite field of q elements and G be a primitive group on a finite set . Then there is a G-action on , namely a map G ! , (g; !) 7! !g = g!; satisfying !gg0 = (gg0)! = g(g0!) for all g; g0 2 G and all ! 2 , and that !1 = 1! = ! for all ! 2 : Let F = ff j f : ! Fg, be the vector space over F with basis . Extending the G-action on linearly, F becomes an FG-module called an FG- permutation module. We are interested in finding all G-invariant FG-submodules, i.e., codes in F . The elements f 2 F are written in the form f = P !2 a! ! where ! is a characteristic function. The natural action of an element g 2 G is given by g P !2 a! ! = P !2 a! g(!): This action of G preserves the natural bilinear form defined by * X a! !; X b! ! + = X a!b!: In this thesis a program is proposed on how to determine codes with given primitive permutation group. The approach is modular representation theoretic and based on a study of maximal submodules of permutation modules F defined by the action of a finite group G on G-sets = G=Gx. This approach provides the advantage of an explicit basis for the code. There appear slightly different concepts of (linear) codes in the literature. Following Knapp and Schmid [83] a code over some finite field F will be a triple (V; ; F), where V = F is a free FG-module of finite rank with basis and a submodule C. By convention we call C a code having ambient space V and ambient basis . F is the alphabet of the code C, the degree n of V its length, and C is an [n; k]-code if C is a free module of dimension k. In this thesis we have surveyed some known methods of constructing codes from primitive permutation representations of finite groups. Generally, our program is more inclusive than these methods as the codes obtained using our approach include the codes obtained using these other methods. The designs obtained by other authors (see for example [40]) are found using our method, and these are in general defined by the support of the codewords of given weight in the codes. Moreover, this method allows for a geometric interpretation of many classes of codewords, and helps establish links with other combinatorial structures, such as designs and graphs. To illustrate the program we determine all 2-modular codes that admit the two known non-isomorphic simple linear groups of order 20160, namely L3(4) and L4(2) = A8. In the process we enumerate and classify all codes preserved by such groups, and provide the lattice of submodules for the corresponding permutation modules. It turns out that there are no self-orthogonal or self-dual codes invariant under these groups, and also that the automorphism groups of their respective codes are in most cases not the prescribed groups. We make use of the Assmus Matson Theorem and the Mac Williams identities in the study of the dual codes. We observe that in all cases the sets of several classes of non-trivial codewords are stabilized by maximal subgroups of the automorphism groups of the codes. The study of the codes invariant under the simple linear group L4(2) leads as a by-product to a unique flag-transitive, point primitive symmetric 2-(64; 28; 12) design preserved by the affi ne group of type 26:S6(2). This has consequently prompted the study of binary codes from the row span of the adjacency matrices of a class of 46 non-isomorphic symmetric 2-(64; 28; 12) designs invariant under the Frobenius group of order 21. Codes obtained from the orbit matrices of these designs have also been studied. The thesis concludes with a discussion of codes that are left invariant by the simple symplectic group S6(2) in all its 2-modular primitive permutation representations. / Thesis (Ph.D.)-University of KwaZulu-Natal, Westville, 2012.

Thesis (Ph. D.)--Michigan State University. Dept. of Mathematics, 2008. / Title from PDF t.p. (viewed on July 24, 2009) Includes bibliographical references (p. 83-84). Also issued in print.

Thesis (Ph. D.)--University of Texas at Austin, 2006. / Vita. Includes bibliographical references.

A logarithmic signature (LS) for a nite group G is an ordered tuple = [A1;A2; : : : ;An] of subsets Ai of G, such that every element g 2 G can be expressed uniquely as a product g = a1a2 : : : ; an, where ai 2 Ai. Logarithmic signatures were dened by Magliveras in the late 1970's for arbitrary nite groups in the context of cryptography. They were also studied for abelian groups by Hajos in the 1930's. The length of an LS is defined to be `() = Pn i=1 jAij. It can be easily seen that for a group G of order Qk j=1 pj mj , the length of any LS for G satises `() Pk j=1mjpj . An LS for which this lower bound is achieved is called a minimal logarithmic signature (MLS). The MLS conjecture states that every finite simple group has an MLS. If the conjecture is true then every finite group will have an MLS. The conjecture was shown to be true by a number of researchers for a few classes of finite simple groups. However, the problem is still wide open. This dissertation addresses the MLS conjecture for the classical simple groups. In particular, it is shown that MLS's exist for the symplectic groups Sp2n(q), the orthogonal groups O 2n(q0) and the corresponding simple groups PSp2n(q) and 2n(q0) for all n 2 N, prime power q and even prime power q0. The existence of an MLS is also shown for all unitary groups GUn(q) for all odd n and q = 2s under the assumption that an MLS exists for GUn 1(q). The methods used are very general and algorithmic in nature and may be useful for studying all nite simple groups of Lie type and possibly also the sporadic groups. The blocks of logarithmic signatures constructed in this dissertation have cyclic structure and provide a sort of cyclic decomposition for these classical groups. / by Nikhil Singhi. / Thesis (Ph.D.)--Florida Atlantic University, 2011. / Includes bibliography. / Electronic reproduction. Boca Raton, Fla., 2011. Mode of access: World Wide Web.

The minimal logarithmic signature conjecture states that in any finite simple group there are subsets Ai, 1 i s such that the size jAij of each Ai is a prime or 4 and each element of the group has a unique expression as a product Qs i=1 ai of elements ai 2 Ai. Logarithmic signatures have been used in the construction of several cryptographic primitives since the late 1970's [3, 15, 17, 19, 16]. The conjecture is shown to be true for various families of simple groups including cyclic groups, An, PSLn(q) when gcd(n; q 1) is 1, 4 or a prime and several sporadic groups [10, 9, 12, 14, 18]. This dissertation is devoted to proving that the conjecture is true for a large class of simple groups of Lie type called classical groups. The methods developed use the structure of these groups as isometry groups of bilinear or quadratic forms. A large part of the construction is also based on the Bruhat and Levi decompositions of parabolic subgroups of these groups. In this dissertation the conjecture is shown to be true for the following families of simple groups: the projective special linear groups PSLn(q), the projective symplectic groups PSp2n(q) for all n and q a prime power, and the projective orthogonal groups of positive type + 2n(q) for all n and q an even prime power. During the process, the existence of minimal logarithmic signatures (MLS's) is also proven for the linear groups: GLn(q), PGLn(q), SLn(q), the symplectic groups: Sp2n(q) for all n and q a prime power, and for the orthogonal groups of plus type O+ 2n(q) for all n and q an even prime power. The constructions in most of these cases provide cyclic MLS's. Using the relationship between nite groups of Lie type and groups with a split BN-pair, it is also shown that every nite group of Lie type can be expressed as a disjoint union of sets, each of which has an MLS. / by NIdhi Singhi. / Thesis (Ph.D.)--Florida Atlantic University, 2011. / Includes bibliography. / Electronic reproduction. Boca Raton, Fla., 2011. Mode of access: World Wide Web.

In this dissertation, we will investigate aspects of Auslander-Reiten theory adapted to the setting of systems of submodule embeddings. Using this theory, we can compute Auslander-Reiten quivers of such categories, which among other information, yields valuable information about the indecomposable objects in such a category. A main result of the dissertation is an adaptation to this situation of the Auslander and Ringel-Tachikawa Theorem which states that for an artinian ring R of finite representation type, each R-module is a direct sum of finite-length indecomposable R-modules. In cases where this applies, the indecomposable objects obtained in the Auslander-Reiten quiver give the building blocks for the objects in the category. We also briefly discuss in which cases systems of submodule embeddings form a Frobenius category, and for a few examples explore pointwise Calabi-Yau dimension of such a category. / by Audrey Moore. / Thesis (Ph.D.)--Florida Atlantic University, 2009. / Includes bibliography. / Electronic reproduction. Boca Raton, Fla., 2009. Mode of access: World Wide Web.

by Lok Tsan-ming. / Thesis (M.Phil.)--Chinese University of Hong Kong, 1994. / Includes bibliographical references (leaves 74-75). / Introduction --- p.2 / Chapter 1 --- "Rings, Modules and Categories" --- p.4 / Chapter 1.1 --- "Rings, Subrings and Ideals" --- p.5 / Chapter 1.2 --- Modules and Categories --- p.8 / Chapter 1.3 --- Module Theory --- p.13 / Chapter 2 --- Isomorphisms between Endomorphism rings of Quasiprogener- ators --- p.24 / Chapter 2.1 --- Preliminaries --- p.24 / Chapter 2.2 --- The Fundamental Theorem --- p.31 / Chapter 2.3 --- Isomorphisms Induced by Semilinear Maps --- p.41 / Chapter 2.4 --- Isomorphisms of General linear groups --- p.46 / Chapter 3 --- Endomorphism ring of projective module --- p.54 / Chapter 3.1 --- Preliminaries --- p.54 / Chapter 3.2 --- Main Theorem --- p.60 / Bibliography --- p.74