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.

O objetivo principal deste trabalho é apresentar um estudo sobre o Teorema de Borsuk-Ulam para forma espacial esférica homotópica. Em nosso trabalho consideramos X uma n-forma espacial esférica homotópica a qual admite uma ação livre de Zp, com p> 2 primo e f : X → Rk uma função contínua e, mostramos que sob determinada relação entre os números n e k, o conjunto A(f) dos pontos de coincidência de f é não vazio / The main objective of this work is to present a study about the Borsuk- Ulam Theorem for homotopic spherical space. In our work we consider X be a n-dimensional homotopic spherical space form which admits a free action of Zp, with p> 2 prime and f : X → Rk be a continuous map and we show that, under certain relations between the numbers n and k, the set A(f) is not empty

Let V be an n-dimensional vector space over the field of q elements. By a geometric t-[q^n, k, λ] design we mean a collection D of k-dimensional subspaces of V, called blocks, such that every t-dimensional subspace T of V appears in exactly λ blocks in D. A large set, LS [N] [t, k, q^n], of geometric designs is a collection on N disjoint t-[q^n, k, λ] designs that partitions [V K], the collection of k-dimensional subspaces of V. In this work we construct non-isomorphic large sets using methods based on incidence structures known as the Kramer-Mesner matrices. These structures are induced by particular group actions on the collection of subspaces of the vector space V. Subsequently, we discuss and use computational techniques for solving certain linear problems of the form AX = B, where A is a large integral matrix and X is a {0,1} solution. These techniques involve (i) lattice basis-reduction, including variants of the LLL algorithm, and (ii) linear programming. Inspiration came from the 2013 work of Braun, Kohnert, Ostergard, and Wassermann, [17], who produced the first nontrivial large set of geometric designs with t ≥ 2. Bal Khadka and Michael Epstein provided the know-how for using the LLL and linear programming algorithms that we implemented to construct the large sets. / Includes bibliography. / Dissertation (Ph.D.)--Florida Atlantic University, 2016. / FAU Electronic Theses and Dissertations Collection

Every transitive permutation representation of a finite group is the representation of the group in its action on the cosets of a particular subgroup of the group. The group has a certain rank for each of these representations. We first find almost all rank-3 and rank-4 transitive representations of the projective special linear group P SL(2, q) where q = pm and p is an odd prime. We also determine the rank of P SL (2, p) in terms of p on the cosets of particular given subgroups. We then investigate the construction of rank-3 transitive and primitive extensions of a simple group, such that the extension group formed is also simple. In the latter context we present a new, group theoretic construction of the famous Hoffman-Singleton graph as a rank-3 graph. / Includes bibliography. / Dissertation (Ph.D.)--Florida Atlantic University, 2015 / FAU Electronic Theses and Dissertations Collection

Neste trabalho resolvemos o problema da classicação dos possíveis esquemas de quebra de simetria que reproduzem as degenerescências do código genético na categoria dos grupos finitos simples, contribuindo assim para a busca de modelos algébricos para a evolução do código genético, iniciada por Hornos & Hornos. / In this work we solve the problem of classifying the possible symmetry breaking schemes based on simple finite groups that reproduce the degeneracies of the genetic code, thus contributing to the search for algebraic models that describe the evolution of the genetic code, initiated by Hornos & Hornos.

abstract INERT SUBGROUPS AND CENTRALIZERS OF INVOLUTIONS IN LOCALLY FINITE SIMPLE GROUPS &uml / Ozyurt, Erdal Ph. D., Department of Mathematics Supervisor: Prof. Dr. Mahmut Kuzucuo&amp / #728 / glu September 2003, 68 pages A subgroup H of a group G is called inert if [H : H Hg] is finite for all g 2 G. A group is called totally inert if every subgroup is inert. Among the basic properties of inert subgroups, we prove the following. Let M be a maximal subgroup of a locally finite group G. If M is inert and abelian, then G is soluble with derived length at most 3. In particular, the given properties impose a strong restriction on the derived length of G. We also prove that, if the centralizer of every involution is inert in an infinite locally finite simple group G, then every finite set of elements of G can not be contained in a finite simple group. In a special case, this generalizes a Theorem of Belyaev&amp / #8211 / Kuzucuo&amp / #728 / glu&amp / #8211 / Se&cedil / ckin, which proves that there exists no infinite locally finite totally inert simple group.

A long-standing conjecture states that if A is a finite group acting fixed point freely on a finite solvable group G of order coprime to jAj, then the Fitting length of G is bounded by the length of the longest chain of subgroups of A. If A is nilpotent, it is expected that the conjecture is true without the coprimeness condition. We prove that the conjecture without the coprimeness condition is true when A is a cyclic group whose order is a product of three primes which are coprime to 6 and the Sylow 2-subgroups of G are abelian. We also prove that the conjecture without the coprimeness condition is true when A is an abelian group whose order is a product of three primes which are coprime to 6 and jGj is odd.

[Formulae and special characters in this field can only be approximated. See PDF version for accurate reproduction] In this thesis we investigate the properties of k-closures of certain finite permutation groups. Given a permutation group G on a finite set Ω, for k ≥ 1, the k-closure G(k) of G is the largest subgroup of Sym(Ω) with the same orbits as G on the set Ωk of k-tuples from Ω. The first problem in this thesis is to study the 3-closures of affine permutation groups. In 1992, Praeger and Saxl showed if G is a finite primitive group and k ≥ 2 then either G(k) and G have the same socle or (G(k),G) is known. In the case where the socle of G is an elementary abelian group, so that G is a primitive group of affine transformations of a finite vector space, the fact that G(k) has the same socle as G gives little information about the relative sizes of the two groups G and G(k). In this thesis we use Aschbacher’s Theorem for subgroups of finite general linear groups to show that, if G ≤ AGL(d, p) is an affine permutation group which is not 3-transitive, then for any point α ∈ Ω, Gα and (G(3) ∩ AGL(d, p))α lie in the same Aschbacher class. Our results rely on a detailed analysis of the 2-closures of subgroups of general linear groups acting on non-zero vectors and are independent of the finite simple group classification. In addition, modifying the work of Praeger and Saxl in [47], we are able to give an explicit list of affine primitive permutation groups G for which G(3) is not affine. The second research problem is to give a partial positive answer to the so-called Polycirculant Conjecture, which states that every transitive 2-closed permutation group contains a semiregular element, that is, a permutation whose cycles all have the same length. This would imply that every vertex-transitive graph has a semiregular automorphism. In this thesis we make substantial progress on the Polycirculant Conjecture by proving that every vertex-transitive, locally-quasiprimitive graph has a semiregular automorphism. The main ingredient of the proof is the determination of all biquasiprimitive permutation groups with no semiregular elements. Publications arising from this thesis are [17, 54].

Thesis (Ph. D.)--State University of New York at Binghamton, of Department of Mathematical Sciences, 2007. / Includes bibliographical references.

Thesis (M. Sc.)--Carleton University, 2002. / Includes bibliographical references (p. 37-38). Also available in electronic format on the Internet.