Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 31 for “"Finite simple groups"”.
-
Non-Abelian Finite Simple Groups as Homomorphic Images
The purpose of exploring infinite groups in this thesis was to discover homomorphic images of non-abelian finite simple groups. These infinite groups are semi-direct products known as progenitors. The permutation progenitors studied were: 2*8 ∶ 22 ∙ A4, 2*10 ∶ D20, 2*4 ∶ C4, 2*7 ∶ (7 ∶ 6), 3*3 ∶ …
-
Designs and codes from certain finite simple groups
… methods for constructing codes and designs from finite groups. The first method was developed by Carmichael and Ernst Witt in the nineteen thirty's. The second method is a generalisation of the first one by D.R. Hughes in the nineteen sixty's. These first two methods use t-transitive groups to …
-
Designs and codes from certain finite simple groups
… methods for constructing codes and designs from finite groups. The first method was developed by Carmichael and Ernst in the nineteen thirty's. The second method is a generalization of the first one by D.R. Hughes in the nineteen sixty's. These first two methods use t-transitive groups to …
-
On the subgroup permutability degree of some finite simple groups
Consider a finite group G and subgroups H, K of G. We say that H and K permute if HK=KH and call H a permutable subgroup if H permutes with every subgroup of G. A group G is called quasi-Dedekind if all subgroups of G are permutable. We can define, for every finite group G, an arithmetic quantity …
-
Centralizers of elements of prime order in locally finite simple groups
Thesis (Ph. D.)--Michigan State University. Department of Mathematics, 2008
-
Shelling The Coset Poset
It is shown that the coset lattice of a finite group has shellable order complex if and only if the group is complemented. It is also shown that the order complex is Cohen-Macaulay under the same circumstances. The group theoretical tools used are relatively elementary, and avoid the classification …
-
Dade's Conjecture for the McLaughlin Simple Group
… with counting characters in the blocks of finite groups. Specifically, Dade's so-called Ordinary Conjecture asserts that if a finite group G has trivial p-core and B is a p-block of G of positive defect, then the number $k(B,\ d)$ of complex irreducible characters with fixed defect d …
-
Dade's Conjecture for the McLaughlin Simple Group
… with counting characters in the blocks of finite groups. Specifically, Dade's so-called Ordinary Conjecture asserts that if a finite group G has trivial p-core, and B is a p-block of G of positive defect, then the number k(B,d) of complex irreducible characters with fixed defect d belonging …
-
Local group theory, the amalgam method, and fusion systems
… 2 amalgams involving strongly \(p\)-embedded subgroups, and recognize some finite simple groups as associated completions. In addition, as an application, we determine all saturated fusion systems supported on a Sylow \(p\)-subgroup of G\(_2(p^n\)) and PSU\(_4(p^n\)) for all primes \(p\) and \(n …
-
Linear Approximation of Groups and Ultraproducts of Compact Simple Groups
We derive basic properties of groups which can be approximated with matrices. These include closure of classes of such groups under group theoretic constructions including direct and inverse limits and free products. We show that metric ultraproducts of projective linear groups over fields of …
-
An induction theorem inspired by Brauer's induction theorem for characters of finite groups
… states that every irreducible character of a finite group G can be expressed as an integral linear combination of induced characters from elementary subgroups. The goal of this thesis is to develop our own induction theorem inspired by both Brauer's induction theorem and Global-Local …
-
The O'Nan-Scott Theorem for Finite Primitive Permutation Groups, and Finite Representability
The O'Nan-Scott Theorem classifies finite primitive permutation groups into one of five isomorphism classes. This theorem is very useful for answering questions about finite permutation groups since four out of the five isomorphism classes are well understood. The proof of this theorem currently …
-
An atlas of characteristic zero representations
Motivated by the World Wide Web Atlas of Finite Group Representations and the recent classification of low-dimensional representations of quasisimple groups in cross-characteristic fields by Hiss and Malle, we construct with a computer over 650 representations of finite simple groups. Explicit …
-
2-local approach to Conway's simple group through the 2-modular geometry of the Leech lattice
Thesis (Ph.D.)--Michigan State University. Department of Mathematics, 1988
-
An Introduction to S(5,8,24)
… combinatorial designs, error-correcting codes, finite simple groups, and sphere packings in a truly remarkable way. This thesis discusses the underlying structure of S(5,8,24), its construction via the (24,12) Golay code, as well its automorphism group, which is the Mathieu group M24, a member …
-
On the Hochschild cohomology of blocks of finite group algebras
… investigate the first Hochschild cohomology of finite group algebras and their blocks, as well as of twisted group algebras. We employ a range of methods and techniques to calculate the structure of some explicit examples, as well as develop the general theory. Our first main result, found in …
-
Irreducible characters of Sylow p-Subgroups associated with some classical linear groups
The classification of finite simple groups states that every finite simple group is isomorphic to one of the following groups: (1) a cyclic group with prime order, (2) an alternating group of degree ≥ 5, (3) a simple group of Lie type, including both the classical Lie groups, namely the simple …
Page 1 of 2