Results 31 to 40 of about 10,924,025 (294)
ON THE GENERATING GRAPH OF A SIMPLE GROUP [PDF]
The generating graph $\unicode[STIX]{x1D6E4}(H)$ of a finite group $H$ is the graph defined on the elements of $H$, with an edge between two vertices if and only if they generate $H$. We show that if $H$ is a sufficiently large simple group with $\unicode[STIX]{x1D6E4}(G)\cong \unicode[STIX]{x1D6E4}(H)$ for a finite group $G$, then $G\cong H$.
LUCCHINI, ANDREA +2 more
openaire +3 more sources
On Huppert's conjecture for F_4(2) [PDF]
Let $G$ be a finite group and let $text{cd}(G)$ be the set of all complex irreducible character degrees of $G$. B. Huppert conjectured that if $H$ is a finite nonabelian simple group such that $text{cd}(G) =text{cd}(H)$, then $Gcong H times A$, where $A$
Hung P Tong-Viet, Thomas P Wakefield
doaj
Groups with a Strongly Embedded Subgroup Saturated with Finite Simple Non-abelian Groups
An important concept in the theory of finite groups is the concept of a strongly embedded subgroup. The fundamental result on the structure of finite groups with a strongly embedded subgroup belongs to M. Suzuki.
A.A. Shlepkin
doaj +1 more source
Relatively hyperbolic groups are C*-simple
We characterize relatively hyperbolic groups whose reduced C*-algebra is simple as those, which have no non-trivial finite normal ...
Arzhantseva, G. +5 more
core +1 more source
On the Fundamental Group of a Simple Lie Group [PDF]
Let G be a simply connected simple Lie group and C the center of G, which is isomorphic with the fundamental group of the adjoint group of G. For an element c of C, an element x of the Lie algebra g of G is called a representative of c in g if exp x = c.
openaire +3 more sources
The probability of generating a finite simple group [PDF]
We study the probability of generating a finite simple group, together with its generalisation PG,socG(d), the conditional probability of generating an almost simple finite group G by d elements, given that these elements generate G/ socG.
Colva M. Roney-Dougal +7 more
core +1 more source
All simple groups with order from 1 million to 5 million are efficient [PDF]
There is much interest in finding short presentations for the finite simple groups. Indeed it has been suggested that all these groups are efficient in a technical sense.
Edmund F. Robertson +3 more
doaj
Finite simple groups as expanders. [PDF]
We prove that there exist k ∈ ℕ and 0 < ε ∈ ℝ such that every non-abelian finite simple group G , which is not a Suzuki group, has a set of k generators for which the Cayley graph Cay( G
Kassabov M, Lubotzky A, Nikolov N.
europepmc +5 more sources
Odd characterizations of almost simple groups - 3-local and character theoretic methods [PDF]
In this PhD thesis we discuss methods of recognizing finite groups by the structure of normalizers of certain 3-subgroups. We explain a method for characterizing groups using character theoretic and block theoretic methods and we use these methods to ...
Astill, Sarah
core +7 more sources
Centralizers in simple locally finite groups [PDF]
This is a survey article on centralizers of finitesubgroups in locally finite, simple groups or LFS-groups as wewill call them. We mention some of the open problems aboutcentralizers of subgroups in LFS-groups and applications of theknown information ...
Mahmut Kuzucuoğlu
doaj

