2016/08/22 by Sumana Hatui, Hatui, Sumana
Mathematics · Engineering · Computer Science · #Finite Group Theory Research #graph theory and CDMA systems #Coding theory and cryptography
paper · pdf · doi:10.48550/arxiv.1608.06322
Let G be a finite p-group of order pn and M(G) be its Schur multiplier. It is well known result by Green that |M(G)|= p(1)/(2)n(n-1)-t(G) for some t(G) ≥ 0. In this article we classify non-abelian p-groups G of order pn for t(G)=logp(|G|)+1.