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 94 for “"Simple Groups"”.
-
Progenitors Involving Simple Groups
… do the double coset enumeration over maximal subgroups for larger constructions. We will also do the construction of sporadic group M22 over maximal subgroup A7, and also J1 with the monomial representation 7^(*2) :_m S_3 \times 2 over maximal subgroup PSL(2,11). We will also look at different …
-
Finitely presented infinite simple groups
… to construct finitely presented infinite simple groups. </p> <p>The finitely presented groups, G<sub>n,i</sub>, constructed by G.Higman [5) are extended by certain subgroups, H, of the inverse limit of wreath products, S<sub>n-1</sub>(wr s<sub>n-1</sub>)<sup>w</sup>. It is shown that if H …
-
Identical relations in simple groups
… is a one-one correspondence between varieties of groups and closed sets of identical relations.</p> <p>A set of identical relations is said to be finitely based if it is the set of consequences of a finite subset (which can be taken to consist of just one element, the direct product of the …
-
Simple Groups and Related Topics
Since every nonabelian simple group is a homomorphic image of an involutory progenitor 2^(*n):N where N ≤ S_n is transitive, our motivation for the thesis has been to seek finite homomorphic images of such progenitors and construct them using our technique of double coset enumeration. We have …
-
Progenitors Related to Simple Groups
… methods of finding new presentations of finite groups, particularly nonabelian simple groups. We have presented several progenitors such as 2^{*8}:Z_4 wr Z_2, 3^{*3}:_m L(2,7), 2^{*4}:[2:2^2], 2^{*11}:D_{11} and many more on which we've found the mathieu group M12 and 2*[M21:2^2] among their …
-
Simple Groups and Related Topics
… symmetric presentations of several important groups. We have investigated permutation and monomial progenitors 2<sup>*8</sup>: (2<sup>3</sup>: 2<sup>2</sup>), 2*9: (3<sup>2</sup>: 2<sup>4</sup>), 2<sup>*10</sup>: (2<sup>4</sup>: (2 × 5)), 5<sup>*4</sup>:<sub>m</sub> (2<sup>3</sup>: …
-
Sporadic simple groups of low genus
… primitive genus g ≤ 2 systems of sporadic almost simple groups.
-
Simple Groups, Progenitors, and Related Topics
… We repeat this process with different control groups and a different array of possible relations to discover interesting groups, such as sporadic, linear, or unitary groups, to name a few. Predominantly this work was produced from transitive groups in 6,10,12, and 18 letters. Which led to …
-
SYMMETRIC PRESENTATIONS OF NON-ABELIAN SIMPLE GROUPS
… is to show constructions of some of the sporadic groups such as the Mathieu group, M<sub>12</sub>, J<sub>1</sub>, Projective Special Linear groups, PSL(2,8), and PSL(2,11), Unitary group U(3,3) and many other non-abelian simple groups. Our purpose is to find all simple non-abelian groups as …
-
On Simple Groups Related to Zassenhaus Groups
Made available in DSpace on 2014-12-09T22:17:52Z (GMT). No. of bitstreams: 1 7000865.pdf: 1820776 bytes, checksum: 98a568f579f517ccb0f7ecef7129fae2 (MD5) Previous issue date: 1969
-
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
… 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 construct …
-
Designs and codes from certain finite simple groups
… 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 construct …
-
Trivial Source Character Tables of Sporadic Simple Groups
… character tables of the first seven sporadic simple groups in different characteristics. The method used to compute these tables is independent from the methods used in [6] and [27], where the authors compute the trivial source character tables of $M_{11}$ in characteristic 3 and of the family …
-
Asymptotics of Hecke operators for quasi-split simple groups
… is the group of adelic points of a quasi-split, simple reductive group. Our main tool is the Arthur-Selberg trace formula. The spectral side is dealt with, utilizing a condition on the normalizing factors of certain intertwining operators. The geometric side is more complicated and needs a more …
-
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 …
-
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 …
Page 1 of 5