Results 31 to 40 of about 998,375 (277)
On Shunkov Groups Saturated with Finite Groups
The structure of the group consisting of elements of finite order depends to a large extent on the structure of the finite subgroups of the group under consideration. One of the effective conditions for investigating an infinite group containing elements
A.A. Shlepkin
doaj +1 more source
Finite groups whose maximal subgroups of even order are MSN-groups
A finite group GG is called an MSN-group if all maximal subgroups of the Sylow subgroups of GG are subnormal in GG. In this article, we investigate the structure of finite groups GG such that GG is a non-MSN-group of even order in which every maximal ...
Wang Wanlin, Guo Pengfei
doaj +1 more source
Blocks of group algebras are derived simple [PDF]
A derived version of Maschke's theorem for finite groups is proved: the derived categories, bounded or unbounded, of all blocks of the group algebra of a finite group are simple, in the sense that they admit no nontrivial recollements.
Liu, Qunhua, Yang, Dong
core +1 more source
On the structure of finite groups isospectral to finite simple groups [PDF]
Abstract Finite groups are said to be isospectral if they have the same sets of element orders. A finite nonabelian simple group L is said to be almost recognizable by spectrum if every finite group isospectral to L is an almost simple group with socle isomorphic to L.
Grechkoseeva, Mariya A. +1 more
openaire +2 more sources
The structure of blocks with a Klein four defect group [PDF]
We prove Erdmann’s conjecture [16] stating that every block with a Klein four defect group has a simple module with trivial source, and deduce from this that Puig’s finiteness conjecture holds for source algebras of blocks with a Klein four defect group.
A. Borel +44 more
core +1 more source
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
Factorizations of finite groups by conjugate subgroups which are solvable or nilpotent [PDF]
We consider factorizations of a finite group $G$ into conjugate subgroups, $G=A^{x_{1}}\cdots A^{x_{k}}$ for $A\leq G$ and $x_{1},\ldots ,x_{k}\in G$, where $A$ is nilpotent or solvable.
Garonzi, Martino +3 more
core +2 more sources
Quasirecognition by Prime Graph of the Groups 2D2n(q) Where q < 105
Let G be a finite group. The prime graph Γ ( G ) of G is defined as follows: The set of vertices of Γ ( G ) is the set of prime divisors of | G | and two distinct vertices p and p ′ are connected in &Gamma ...
Hossein Moradi +2 more
doaj +1 more source
Ramified rectilinear polygons: coordinatization by dendrons
Simple rectilinear polygons (i.e. rectilinear polygons without holes or cutpoints) can be regarded as finite rectangular cell complexes coordinatized by two finite dendrons.
A Dress +33 more
core +3 more sources
Coprime invariable generation and minimal-exponent groups [PDF]
A finite group $G$ is \emph{coprimely-invariably generated} if there exists a set of generators $\{g_1, ..., g_u\}$ of $G$ with the property that the orders $|g_1|, ..., |g_u|$ are pairwise coprime and that for all $x_1, ..., x_u \in G$ the set $\{g_1 ...
Detomi, Eloisa +2 more
core +2 more sources

