A solvability criterion for finite groups related to the number of Sylow subgroups
Sajjad Mahmood Robati
Abstract
Sajjad Mahmood Robati
Abstract
Let G be a finite group and let π(G) be the set of primes dividing the order of G. For each p∈π(G), the Sylow theorems state that the number of Sylow p-subgroups of G is equal to kp + 1 for some non-negative integer k. In this article, we characterize non-solvable groups G containing at most p2+1 Sylow p-subgroups for each p∈π(G). In particular, we show that each finite group G containing at most (p−1)p+1 Sylow p-subgroups for each p∈π(G) is solvable.
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Let G be a finite group and let π(G) be the set of primes dividing the order of G. For each p∈π(G), the Sylow theorems state that the number of Sylow p-subgroups of G is equal to kp + 1 for some non-negative integer k. In this article, we characterize non-solvable groups G containing at most p2+1 Sylow p-subgroups for each p∈π(G). In particular, we show that each finite group G containing at most (p−1)p+1 Sylow p-subgroups for each p∈π(G) is solvable.
Key concepts: Sylow theorems, Mathematics, Locally finite group, Combinatorics, Finite group, Complement (music), Order (exchange), Integer (computer science)