Results 11 to 20 of about 1,000,341 (271)
The Quarterly Journal of Mathematics, 1987 This paper deals with the problem of enumerating the number f(n) of isomorphism types of groups of order n. There are three results which give upper bounds for f(n). The first bound holds for arbitrary groups, the second one deals with solvable groups, while the third one applies to groups with abelian Sylow subgroups.
Mciver, A, Neumann, P
openaire +2 more sources
A Study On the Kernels of Irreducible Characters of Finite Groups
Cumhuriyet Science Journal, 2022 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]
, 2017 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 Having Monolithic Characters of Prime Degree
Düzce Üniversitesi Bilim ve Teknoloji Dergisi, 2021 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
On Shunkov Groups Saturated with Finite Groups
Известия Иркутского государственного университета: Серия "Математика", 2018 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
Journal of Pure and Applied Algebra, 2011 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
Finite groups with 4p2q elements of maximal order
Open Mathematics, 2021 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
On finite totally $2$-closed groups
Comptes Rendus. Mathématique, 2022 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
F^ω-injectors of finite groups [PDF]
Известия Саратовского университета. Новая серия: Математика. Механика. ИнформатикаOnly finite groups and classes of finite groups are considered. $\frak F$-injectors (B. Fischer, W. Gaschutz, B. Hartley, 1967) and $\frak F$-projectors (W.
Sorokina, Marina M., Novikova, Diana G.
doaj +1 more source
FINITELY ANNIHILATED GROUPS [PDF]
Bulletin of the Australian Mathematical Society, 2014 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