- About
-
The Global ETD Search service is a free service for researchers
to find electronic theses and dissertations. This service is
provided by the
Networked Digital Library of Theses and Dissertations.
Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
Search results
Showing 71 to 80 of 584 (0.064 seconds)| 71 |
Frobenius groups with cyclic kernelCuddihy, Gerald. January 1968 (has links)
No description available.
|
| 72 |
On representations for subgroupsRuó, Shu-Chen. January 1969 (has links)
No description available.
|
| 73 |
The simplicity of the projective unimodular group over the field GF(q), g=pm /Yee, Tai Loy. January 1969 (has links)
No description available.
|
| 74 |
Generalizations of nilpotent groupsAnderson, Michela January 1970 (has links)
No description available.
|
| 75 |
The algebraic structure and computation of Schur rings邵慰慈, Shiu, Wai-chee. January 1992 (has links)
published_or_final_version / Mathematics / Doctoral / Doctor of Philosophy
|
| 76 |
The algebraic structure and computation of Schur rings /Shiu, Wai-chee. January 1992 (has links)
Thesis (Ph. D.)--University of Hong Kong, 1993.
|
| 77 |
Automorphism Groups of Strong Bruhat Orders of Coxeter GroupsSutherland, David C. (David Craig) 08 1900 (has links)
In this dissertation, we describe the automorphism groups for the strong Bruhat orders A_n-1, B_n, and D_n. In particular, the automorphism group of A_n-1 for n ≥ 3 is isomorphic to the dihedral group of order eight, D_4; the automorphism group of B_n for n ≥ 3 is isomorphic to C_2 x C_2 where C_2 is the cyclic group of order two; the automorphism group of D_n for n > 5 and n even is isomorphic to C_2 x C_2 x C_2; and the automorphism group of D_n for n ≥ 5 and n odd is isomorphic to the dihedral group D_4.
|
| 78 |
Geometric methods in the study of Pride groups and relative presentationsDavidson, Peter John. January 2008 (has links)
Thesis (Ph.D.) - University of Glasgow, 2008. / Ph.D. thesis submitted to the Faculty of Information and Mathematical Sciences, Department of Mathematics, University of Glasgow, 2008. Includes bibliographical references. Print version also available.
|
| 79 |
Statistical properties of Thompson's Group and random pseudo manifolds /Woodruff, Benjamin M., January 2005 (has links) (PDF)
Thesis (Ph. D.)--Brigham Young University. Dept. of Mathematics, 2005. / Includes bibliographical references (p. 113-114).
|
| 80 |
Computational investigation into finite groupsTaylor, Paul Anthony January 2011 (has links)
We briefly discuss the algorithm given in [Bates, Bundy, Perkins, Rowley, J. Algebra, 316(2):849-868, 2007] for determining the distance between two vertices in a commuting involution graph of a symmetric group.We develop the algorithm in [Bates, Rowley, Arch. Math. (Basel), 85(6):485-489, 2005] for computing a subgroup of the normalizer of a 2-subgroup X in a finite group G, examining in particular the issue of when to terminate the randomized procedure. The resultant algorithm is capable of handling subgroups X of order up to 512 and is suitable, for example, for matrix groups of large degree (an example calculation is given using 112x112 matrices over GF(2)).We also determine the suborbits of conjugacy classes of involutions in several of the sporadic simple groups?namely Janko's group J4, the Fischer sporadic groups, and the Thompson and Harada-Norton groups. We use our results to determine the structure of some graphs related to this data.We include implementations of the algorithms discussed in the computer algebra package MAGMA, as well as representative elements for the involution suborbits.
|
Page generated in 0.0712 seconds