Displaying 201 – 220 of 242

Showing per page

On the recognizability of some projective general linear groups by the prime graph

Masoumeh Sajjadi (2022)

Commentationes Mathematicae Universitatis Carolinae

Let G be a finite group. The prime graph of G is a simple graph Γ ( G ) whose vertex set is π ( G ) and two distinct vertices p and q are joined by an edge if and only if G has an element of order p q . A group G is called k -recognizable by prime graph if there exist exactly k nonisomorphic groups H satisfying the condition Γ ( G ) = Γ ( H ) . A 1-recognizable group is usually called a recognizable group. In this problem, it was proved that PGL ( 2 , p α ) is recognizable, if p is an odd prime and α > 1 is odd. But for even α , only the recognizability...

On the structure of finite loop capable Abelian groups

Markku Niemenmaa (2007)

Commentationes Mathematicae Universitatis Carolinae

Loop capable groups are groups which are isomorphic to inner mapping groups of loops. In this paper we show that abelian groups C p k × C p × C p , where k 2 and p is an odd prime, are not loop capable groups. We also discuss generalizations of this result.

On the structure of finite loop capable nilpotent groups

Miikka Rytty (2010)

Commentationes Mathematicae Universitatis Carolinae

In this paper we consider finite loops and discuss the problem which nilpotent groups are isomorphic to the inner mapping group of a loop. We recall some earlier results and by using connected transversals we transform the problem into a group theoretical one. We will get some new answers as we show that a nilpotent group having either C p k × C p l , k > l 0 as the Sylow p -subgroup for some odd prime p or the group of quaternions as the Sylow 2 -subgroup may not be loop capable.

Currently displaying 201 – 220 of 242