Results 11 to 20 of about 1,692,668 (268)
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
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 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
Infinite locally finite simple groups with many complemented subgroups [PDF]
We prove that the following families of (infinite) groups have complemented subgroup lattice: alternating groups, finitary symmetric groups, Suzuki groups over an infinite locally finite field of characteristic $2$, Ree groups over an infinite ...
Maria Ferrara, Marco Trombetti
doaj +1 more source
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
The NEPS of Gain Graphs over Arbitrary Groups and its Spectra [PDF]
We provide two definitions for a gain function on a non-complete extended p-sum (NEPS) of gain graphs over arbitrary groups. In the first one, the gain function takes values in the direct product of the gain groups of the factors.
Matteo Cavaleri +2 more
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
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
A new characterization of L2(p2)
For a positive integer n and a prime p, let np{n}_{p} denote the p-part of n. Let G be a group, cd(G)\text{cd}(G) the set of all irreducible character degrees of GG, ρ(G)\rho (G) the set of all prime divisors of integers in cd(G)\text{cd}(G), V(G)=pep(G)|
Wang Zhongbi +4 more
doaj +1 more source
On conjugacy classes of the F4 group over a field q with characteristic 2
This article continues a series of papers devoted to solving the problem by which a non-identity conjugacy class in a finite simple non-abelian group contains commuting elements. Previously, this statement was tested for sporadic, projective, alternating
Yurova Nadezhda
doaj +1 more source

