scholarly journals On a bound of Cocke and Venkataraman

2021 ◽  
Author(s):  
Benjamin Sambale ◽  
Philipp Wellmann
Keyword(s):  
Finite Group ◽  
Recent Result ◽  
Finite Groups ◽  
Prime Divisors ◽  
Euler’S Totient Function ◽  
A Finite Group

AbstractLet G be a finite group with exactly k elements of largest possible order m. Let q(m) be the product of $$\gcd (m,4)$$ gcd ( m , 4 ) and the odd prime divisors of m. We show that $$|G|\le q(m)k^2/\varphi (m)$$ | G | ≤ q ( m ) k 2 / φ ( m ) where $$\varphi $$ φ denotes Euler’s totient function. This strengthens a recent result of Cocke and Venkataraman. As an application we classify all finite groups with $$k<36$$ k < 36 . This is motivated by a conjecture of Thompson and unifies several partial results in the literature.

scholarly journals On the minimum degree of the power graph of a finite cyclic group

2020 ◽  
pp. 2150044
Author(s):  
Ramesh Prasad Panda ◽  
Kamal Lochan Patra ◽  
Binod Kumar Sahoo
Keyword(s):  
Finite Group ◽  
Cyclic Group ◽  
Finite Groups ◽  
Minimum Degree ◽  
Simple Graph ◽  
The Other ◽  
Prime Divisors ◽  
Power Graph ◽  
Vertex Set ◽  
A Finite Group

The power graph [Formula: see text] of a finite group [Formula: see text] is the undirected simple graph whose vertex set is [Formula: see text], in which two distinct vertices are adjacent if one of them is an integral power of the other. For an integer [Formula: see text], let [Formula: see text] denote the cyclic group of order [Formula: see text] and let [Formula: see text] be the number of distinct prime divisors of [Formula: see text]. The minimum degree [Formula: see text] of [Formula: see text] is known for [Formula: see text], see [R. P. Panda and K. V. Krishna, On the minimum degree, edge-connectivity and connectivity of power graphs of finite groups, Comm. Algebra 46(7) (2018) 3182–3197]. For [Formula: see text], under certain conditions involving the prime divisors of [Formula: see text], we identify at most [Formula: see text] vertices such that [Formula: see text] is equal to the degree of at least one of these vertices. If [Formula: see text], or that [Formula: see text] is a product of distinct primes, we are able to identify two such vertices without any condition on the prime divisors of [Formula: see text].

Some sufficient conditions on solvability of finite groups

2016 ◽  
Vol 15 (03) ◽  
pp. 1650057 ◽  
Author(s):  
Wei Meng ◽  
Jiakuan Lu ◽  
Li Ma ◽  
Wanqing Ma
Keyword(s):  
Finite Group ◽  
Finite Groups ◽  
Sufficient Conditions ◽  
Conjugacy Classes ◽  
Maximal Subgroups ◽  
Prime Divisors ◽  
Abelian Subgroups ◽  
A Finite Group

For a finite group [Formula: see text], the symbol [Formula: see text] denotes the set of the prime divisors of [Formula: see text] denotes the number of conjugacy classes of maximal subgroups of [Formula: see text]. Let [Formula: see text] denote the number of conjugacy classes of non-abelian subgroups of [Formula: see text] and [Formula: see text] denote the number of conjugacy classes of all non-normal non-abelian subgroups of [Formula: see text]. In this paper, we consider the finite groups with [Formula: see text] or [Formula: see text]. We show these groups are solvable.

N-critical graph of finite groups

2021 ◽  
Author(s):  
Viachaslau I. Murashka
Keyword(s):  
Finite Group ◽  
Directed Graph ◽  
Finite Groups ◽  
Soluble Group ◽  
Prime Divisors ◽  
Nilpotent Length ◽  
Critical Graph ◽  
Vertex Set ◽  
A Finite Group

A Schmidt [Formula: see text]-group is a non-nilpotent [Formula: see text]-group whose proper subgroups are nilpotent and which has the normal Sylow [Formula: see text]-subgroup. The [Formula: see text]-critical graph [Formula: see text] of a finite group [Formula: see text] is a directed graph on the vertex set [Formula: see text] of all prime divisors of [Formula: see text] and [Formula: see text] is an edge of [Formula: see text] if and only if [Formula: see text] has a Schmidt [Formula: see text]-subgroup. The bounds of the nilpotent length of a soluble group are obtained in terms of its [Formula: see text]-critical graph. The structure of a soluble group with given [Formula: see text]-critical graph is obtained in terms of commutators. The connections between [Formula: see text]-critical and other graphs (Sylow, soluble, prime, commuting) of finite groups are found.

On Prime Spectrum of Maximal Subgroups in Finite Groups

2018 ◽  
Vol 25 (04) ◽  
pp. 579-584
Author(s):  
Chi Zhang ◽  
Wenbin Guo ◽  
Natalia V. Maslova ◽  
Danila O. Revin
Keyword(s):  
Finite Group ◽  
Positive Integer ◽  
Maximal Subgroup ◽  
Finite Groups ◽  
Maximal Subgroups ◽  
Prime Spectrum ◽  
Prime Divisors ◽  
A Finite Group ◽  
Theoretical Results

For a positive integer n, we denote by π(n) the set of all prime divisors of n. For a finite group G, the set [Formula: see text] is called the prime spectrum of G. Let [Formula: see text] mean that M is a maximal subgroup of G. We put [Formula: see text] and [Formula: see text]. In this notice, using well-known number-theoretical results, we present a number of examples to show that both K(G) and k(G) are unbounded in general. This implies that the problem “Are k(G) and K(G) bounded by some constant k?”, raised by Monakhov and Skiba in 2016, is solved in the negative.

scholarly journals Two problems on finite groups with k conjugate classes

1968 ◽  
Vol 8 (1) ◽  
pp. 49-55 ◽  
Author(s):  
John Poland
Keyword(s):  
Finite Group ◽  
Representation Theory ◽  
Finite Groups ◽  
Prime Divisors ◽  
Image Position ◽  
A Finite Group ◽  
Generally True

Let G be a finite group of order g having exactly k conjugate classes. Let π(G) denote the set of prime divisors of g. K. A. Hirsch [4] has shown that By the same methods we prove g ≡ k modulo G.C.D. {(p–1)2 p ∈ π(G)} and that if G is a p-group, g = h modulo (p−1)(p2−1). It follows that k has the form (n+r(p−1)) (p2−1)+pe where r and n are integers ≧ 0, p is a prime, e is 0 or 1, and g = p2n+e. This has been established using representation theory by Philip Hall [3] (see also [5]). If then simple examples show (for 6 ∤ g obviously) that g ≡ k modulo σ or even σ/2 is not generally true.

On the number of same order classes of non-abelian subgroups of a finite group

2020 ◽  
pp. 2250036
Author(s):  
Wei Meng ◽  
Guifang Yang ◽  
Jiakuan Lu
Keyword(s):  
Finite Group ◽  
Lower Bounds ◽  
Finite Groups ◽  
Solvable Groups ◽  
Prime Divisors ◽  
Abelian Subgroups ◽  
A Finite Group

Let [Formula: see text] be a finite group and [Formula: see text] denote the set of the prime divisors of [Formula: see text]. The symbol [Formula: see text] denotes the number of same order classes of all non-abelian subgroups of [Formula: see text]. Firstly, the finite groups with [Formula: see text] are classified completely. Secondly, the lower bounds on [Formula: see text] are obtained by the functions of [Formula: see text]. In particular, it is showed that [Formula: see text] for non-solvable groups [Formula: see text]. Finally, the structure of groups with [Formula: see text] is investigated.

NOTES ON FINITE SIMPLE GROUPS WHOSE ORDERS HAVE THREE OR FOUR PRIME DIVISORS

2009 ◽  
Vol 08 (03) ◽  
pp. 389-399 ◽  
Author(s):  
LIANGCAI ZHANG ◽  
GUIYUN CHEN ◽  
SHUNMIN CHEN ◽  
XUEFENG LIU
Keyword(s):  
Finite Group ◽  
Finite Groups ◽  
Prime Graph ◽  
Simple Groups ◽  
Finite Simple Groups ◽  
Prime Divisors ◽  
Order Component ◽  
A Finite Group ◽  
Order Components ◽  
Positive Integers

Based on the prime graph of a finite group, its order can be divided into a product of some co-prime positive integers. These integers are called order components of this group. If there exist exactly k nonisomorphic finite groups with the same set of order components of a given finite group, we say that it is a k-recognizable group by its order component(s). In the present paper, we obtain that all finite simple Kn-groups (n = 3, 4) except U4(2) and A10can be uniquely determined by their order components. Moreover, U4(2) is 2-recognizable and A10is k-recognizable, where k denotes the number of all nonisomorphic classes of groups with the same order as A10. As a consequence of this result we can obtain some interesting corollaries.

scholarly journals Finite groups with some weakly pronormal subgroups

2020 ◽  
Vol 18 (1) ◽  
pp. 1742-1747
Author(s):  
Jianjun Liu ◽  
Mengling Jiang ◽  
Guiyun Chen
Keyword(s):  
Finite Group ◽  
Finite Groups ◽  
A Finite Group

Abstract A subgroup H of a finite group G is called weakly pronormal in G if there exists a subgroup K of G such that G = H K G=HK and H ∩ K H\cap K is pronormal in G. In this paper, we investigate the structure of the finite groups in which some subgroups are weakly pronormal. Our results improve and generalize many known results.

scholarly journals A on simplicity criterion for finite groups

1969 ◽  
Vol 10 (3-4) ◽  
pp. 359-362
Author(s):  
Nita Bryce
Keyword(s):  
Finite Group ◽  
Normal Subgroup ◽  
Finite Groups ◽  
Odd Order ◽  
A Finite Group

M. Suzuki [3] has proved the following theorem. Let G be a finite group which has an involution t such that C = CG(t) ≅ SL(2, q) and q odd. Then G has an abelian odd order normal subgroup A such that G = CA and C ∩ A = 〈1〉.

On S-Quasinormal and C-Normal Subgroups of Prime Power Order in Finite Groups

2011 ◽  
Vol 18 (04) ◽  
pp. 685-692
Author(s):  
Xuanli He ◽  
Shirong Li ◽  
Xiaochun Liu
Keyword(s):  
Finite Group ◽  
Finite Groups ◽  
Prime Power ◽  
Maximal Subgroups ◽  
Prime Power Order ◽  
Normal Subgroups ◽  
A Finite Group

Let G be a finite group, p the smallest prime dividing the order of G, and P a Sylow p-subgroup of G with the smallest generator number d. Consider a set [Formula: see text] of maximal subgroups of P such that [Formula: see text]. It is shown that if every member [Formula: see text] of is either S-quasinormally embedded or C-normal in G, then G is p-nilpotent. As its applications, some further results are obtained.

Sign in / Sign up

Export Citation Format

Share Document