Results 21 to 30 of about 15,309,834 (359)
Brauer relations in finite groups [PDF]
If G is a non-cyclic finite group, non-isomorphic G-sets X, Y may give rise to isomorphic permutation representations C[X] and C[Y]. Equivalently, the map from the Burnside ring to the representation ring of G has a kernel. Its elements are called Brauer
Bartel, Alex, Dokchitser, Tim
core +4 more sources
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
A Study On the Kernels of Irreducible Characters of Finite Groups
Let G be a finite group and χ∈Irr(G), where Irr(G) denotes the set of all irreducible characters of G. The kernel of χ is defined by ker(χ)={ g∈G ┤| χ(g)=χ(1)}, where χ(1) is the character degree of χ. The irreducible character χ of G is called as
Temha Erkoç, Burcu Çınarcı
doaj +1 more source
Finite groups of units of finite characteristic rings [PDF]
In \cite[Problem 72]{Fuchs60} Fuchs asked the following question: which groups can be the group of units of a commutative ring? In the following years, some partial answers have been given to this question in particular cases.
Del Corso, I., Dvornicich, R.
core +2 more sources
Finite groups with 4p2q elements of maximal order
It is an interesting and difficult topic to determine the structure of a finite group by the number of elements of maximal order. This topic is related to Thompson’s conjecture, that is, if two finite groups have the same order type and one of them is ...
Tan Sanbiao, Chen Guiyun, Yan Yanxiong
doaj +1 more source
Finite Groups Having Monolithic Characters of Prime Degree
Let G be a finite group. An irreducible character χ is called monolithic when the factor group G/ker(χ) has unique minimal normal subgroup. In this paper, we prove that for the smallest prime q dividing the order of G if G has a faithful imprimitive ...
Temha Erkoç, Burcu Çınarcı
doaj +1 more source
We call a group $G$ {\it algorithmically finite} if no algorithm can produce an infinite set of pairwise distinct elements of $G$. We construct examples of recursively presented infinite algorithmically finite groups and study their properties. For instance, we show that the Equality Problem is decidable in our groups only on strongly (exponentially ...
Myasnikov, Alexei, Osin, Denis
openaire +2 more sources
On finite totally $2$-closed groups
An abstract group $G$ is called totally $2$-closed if $H=H^{(2),\Omega }$ for any set $\Omega $ with $G\cong H\le \mathrm{Sym}(\Omega )$, where $H^{(2),\Omega }$ is the largest subgroup of $\mathrm{Sym}(\Omega )$ whose orbits on $\Omega \times \Omega ...
Abdollahi, Alireza +2 more
doaj +1 more source
FINITELY ANNIHILATED GROUPS [PDF]
AbstractIn 1976, Wiegold asked if every finitely generated perfect group has weight 1. We introduce a new property of groups,finitely annihilated, and show that this might be a possible approach to resolving Wiegold’s problem. For finitely generated groups, we show that in several classes (finite, solvable, free), being finitely annihilated is ...
openaire +3 more sources
On the Connectivity of Proper Power Graphs of Finite Groups [PDF]
We study the connectivity of proper power graphs of some family of finite groups including nilpotent groups, groups with a nontrivial partition, and symmetric and alternating groups.
Alireza Doostabadi +1 more
semanticscholar +1 more source

