Results 11 to 20 of about 1,847,445 (268)
Simple groups contain minimal simple groups [PDF]
It is a consequence of the classification of finite simple groups that every non-abelian simple group contains a subgroup which is a minimal simple group.
Barry, M. J. J., Ward, M. B.
openaire +3 more sources
Finite Groups Isospectral to Simple Groups
The spectrum of a finite group is the set of element orders of this group. The main goal of this paper is to survey results concerning recognition of finite simple groups by spectrum, in particular, to list all finite simple groups for which the recognition problem is solved.
Maria A. Grechkoseeva +4 more
openaire +3 more sources
On a conjecture on simple groups [PDF]
The purpose of this paper is to rephrase a conjecture about simple groups into the language of linear algebra. Let G be a group of finite order o(G). Then by rF we shall mean the group ring of G over a field of characteristic p (for instance the integers modulo p). We shall denote the radical of rF by N,. If p = 0 or p o(G), then it is known that Np=(O)
openaire +2 more sources
The main aim of this article is to establish a classification of simple polyadic groups in terms of ordinary groups and their automorphisms. We give two different definitions of simpleness for polyadic groups, from the point of views of universal algebra, UAS (universal algebraically simpleness), and group theory, GTS (group theoretically simpleness ...
Khodabandeh, H., Shahryari, M.
openaire +2 more sources
On Group-Vertex-Magic Labeling of Simple Graphs
Let A be an Abelian group with identity 0. The A-vertex-magic labeling of a graph G is a mapping from the set of vertices in G to A-{0} such that the sum of the labels of every open neighborhood vertex of v is equal, for every vertex v in G.
Muhammad Husnul Khuluq +2 more
doaj +1 more source
The first example of a simple 2−(81,6,2) design
We give the very first example of a simple 2−(81,6,2)design. Its points are the elements of the elementary abelian group of order 81 and each block is the union of two parallel lines of the 4-dimensional geometry over the field of order 3.
Anamari Nakic
doaj +1 more source
A finite simple group \(G\) is called simple \(K_n\)-group if the order of \(G\) has exactly \(n\) distinct prime factors. It is well known that the number of simple \(K_3\)-groups is eight [\textit{M. Herzog}, J. Algebra 10, 383-388 (1968; Zbl 0167.29101)].
Bugeaud, Yann +2 more
openaire +2 more sources
On the tree-number of the power graph associated with some finite groups [PDF]
Given a group G, we define the power graph P(G) as follows: the vertices are the elements of G and two vertices x and y are joined by an edge if ⟨x⟩ ⊆ ⟨y⟩ or ⟨y⟩ ⊆ ⟨x⟩.
Sakineh Rahbariyan
doaj +1 more source
THE EASY APPROACH TO GROUP AGENCY. A SIMPLE REALIST VIEW ON GROUP AGENTS
We talk about groups as doing something, we talk as if groups have agency. Is our talk legitimate? Are there group agents? Is there something like group agency?
Andreea POPESCU
doaj +1 more source
On two generation methods for the simple linear group $PSL(3,7)$ [PDF]
A finite group $G$ is said to be \textit{$(l,m, n)$-generated}, if it is a quotient group of the triangle group $T(l,m, n) = \left.$ In [J. Moori, $(p, q, r)$-generations for the Janko groups $J_{1}$ and $J_{2}$, Nova J.
Thekiso Seretlo
doaj +1 more source

