• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 21
  • 2
  • 2
  • 2
  • 2
  • 1
  • Tagged with
  • 33
  • 33
  • 33
  • 11
  • 8
  • 7
  • 7
  • 7
  • 6
  • 4
  • 4
  • 4
  • 3
  • 3
  • 3
  • 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.
21

Linear codes obtained from 2-modular representations of some finite simple groups.

Chikamai, Walingo Lucy. January 2012 (has links)
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.
22

Centralizers of elements of prime order in locally finite simple groups

Seçkin, Elif. January 2008 (has links)
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.
23

Dirichlet's Theorem in projective general linear groups and the Absolute Siegel's Lemma

Pekker, Alexander, January 1900 (has links) (PDF)
Thesis (Ph. D.)--University of Texas at Austin, 2006. / Vita. Includes bibliographical references.
24

The existence of minimal logarithmic signatures for classical groups

Unknown Date (has links)
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.
25

On the minimal logarithmic signature conjecture

Unknown Date (has links)
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.
26

Auslander-Reiten theory for systems of submodule embeddings

Unknown Date (has links)
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.
27

Morita equivalence and isomorphisms between general linear groups.

January 1994 (has links)
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
28

Tensor Maps of Twisted Group Schemes and Cohomological Invariants

Ruether, Cameron 10 December 2021 (has links)
Working over an arbitrary field F of characteristic not 2, we consider linear algebraic groups over F. We view these as functors, represented by finitely generated F-Hopf algebras, from the category of commutative, associative, F-algebras Alg_F, to the category of groups. Classical examples of these groups, such as the special linear group SL_n are split, however there are also linear algebraic groups arising from central simple F-algebras which are non-split. For example, associated to a non-split central simple F-algebra A of degree n is a non-split special linear group SL(A). It is well known that central simple algebras are twisted forms of matrix algebras. This means that over the separable closure of F, denoted F_sep, we have A⊗_F F_sep ∼= M_n(F_sep) and that there is a twisted Gal(F_sep/F)-action on M_n(F_sep) whose fixed points are A. We show that a similar method of twisted Galois descent can be used to obtain all non-split semisimple linear algebraic groups associated to central simple algebras as fixed points within their split counterparts. In particular, these techniques can be used to construct the spin and half-spin groups Spin(A, τ ) and HSpin(A, τ ) associated to a central simple F-algebra of degree 4n with orthogonal involution. Furthermore, we develop a theory of twisted Galois descent for Hopf algebras and show how the fixed points obtained this way are the representing Hopf algebras of our non-split groups. Returning to the view of group schemes as functors, we discuss how the group schemes we consider are sheaves on the étale site of Alg_F whose stalks are Chevalley groups over local, strictly Henselian F-algebras. This allows us to use the generators and relations presentation of Chevalley groups to explicitly describe group scheme morphisms. After showing how the Kronecker tensor product of matrices induces maps between simply connected groups, we give an explicit description of these maps in terms of Chevalley generators. This allows us to compute the kernel of these new maps composed with standard isogenies and thereby construct new tensor product maps between non-simply connected split groups. These new maps are Gal(F_sep/F)-morphisms and so we apply our techniques of twisted Galois descent to also obtain new tensor product morphisms between non-split groups schemes. Finally, we use one of our new split tensor product maps to compute the degree three cohomological invariants of HSpin_4n for all n.
29

The residually weakly primitive and locally two-transitive rank two geometries for the groups PSL(2, q)

De Saedeleer, Julie 15 October 2010 (has links)
The main goal of this thesis is a contribution to the classification of all incidence geometries<p>of rank two on which some group PSL(2,q), q a prime power, acts flag-transitively.<p>Actually we require that the action be RWPRI (residually weakly primitive) and (2T)1<p>(doubly transitive on every residue of rank one). In fact our definition of RWPRI requires<p>the geometry to be firm (each residue of rank one has at least two elements) and RC<p>(residually connected).<p><p>The main goal is achieved in this thesis.<p>It is stated in our "Main Theorem". The proof of this theorem requires more than 60pages.<p><p>Quite surprisingly, our proof in the direction of the main goal uses essentially the classification<p>of all subgroups of PSL(2,q), a famous result provided in Dickson’s book "Linear groups: With an exposition of the Galois field theory", section 260, in which the group is called Linear Fractional Group LF(n, pn).<p><p>Our proof requires to work with all ordered pairs of subgroups up to conjugacy.<p><p>The restrictions such as RWPRI and (2T)1 allow for a complete analysis.<p><p>The geometries obtained in our "Main Theorem" are bipartite graphs; and also locally 2-arc-transitive<p>graphs in the sense of Giudici, Li and Cheryl Praeger. These graphs are interesting in their own right because of<p>the numerous connections they have with other fields of mathematics. / Doctorat en Sciences / info:eu-repo/semantics/nonPublished
30

The Minkowski-Siegel Formula for quadratic bundles on curves / The Minkowski-Siegel Formula for quadratic bundles on curves

Cerviño, Juan Marcos 13 July 2006 (has links)
No description available.

Page generated in 0.0818 seconds