Bounds On the order of the Schur multiplier of p-groups

2023/01/22 by Pradeep Kumar Rai, Rai, Pradeep Kumar
Computer Science · Engineering · Mathematics · #Coding theory and cryptography #FOS: Mathematics #Finite Group Theory Research #Group Theory (math.GR) #graph theory and CDMA systems

paper · pdf · doi:10.48550/arxiv.2301.09101

openalex publication_date 2023/01/22 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

In 1956, Green provided a bound on the order of the Schur multiplier of p-groups. This bound, given as a function of the order of the group, is the best possible. Since then, the bound has been refined numerous times by adding other inputs to the function, such as, the minimal number of generators of the group and the order of the derived subgroup. We strengthen these bounds by adding another input, the group's nilpotency class. The specific cases of nilpotency class 2 and maximal class are discussed in greater detail.

Related

• On the order of the Schur multiplier of p-groups
• A note on the order of the Schur multiplier of p-groups
• Classification of finite p-groups by the size of their Schur multipliers
• Finite p-groups having Schur multiplier of maximum order
• Classifying p-groups via their multiplier