abstract. in this paper, we classify all of the finite p-groups with at most three non linear irreducible character kernels.

let $g$ be a non-abelian group of order $p^n$‎, ‎where $nleq 5$ in which $g$ is not extra special of order $p^5$‎. ‎in this paper we determine the maximal size of subsets $x$ of $g$‎ ‎with the property that $xyneq yx$ for any $x,y$ in $x$ with‎ ‎$xneq y$‎.

‎‎here we construct and count all ordinary irreducible characters of sylow $p$-subgroups of the steinberg triality groups ${}^3d_4(p^{3m})$.

let g be a finite group and let $gk(g)$ be the prime graph of g. we assume that $n$ is an odd number. in this paper, we show that if $gk(g)=gk(b_n(p))$, where $ngeq 9$ and $pin {3,5,7}$, then g has a unique nonabelian composition factor isomorphic to $b_n(p)$ or $c_n(p)$ . as consequences of our result, $b_n(p)$ is quasirecognizable by its spectrum and also by a new proof, the validity of a con...

a $p$-group $g$ is called a $mathcal{cac}$-$p$-group if $c_g(h)/h$ is ‎cyclic for every non-cyclic abelian subgroup $h$ in $g$ with $hnleq‎ ‎z(g)$‎. ‎in this paper‎, ‎we give a complete classification of‎ ‎finite $mathcal{cac}$-$p$-groups‎.

in this paper we find systems of subgroups of a finite‎ ‎group‎, ‎which $bbb p$nobreakdash-hspace{0pt}subnormality guarantees supersolvability‎ ‎of the whole group‎.

In this paper we enumerate fuzzy subgroups, up to a natural equivalence, of some finite abelian p-groups of rank two where p is any prime number. After obtaining the number of maximal chains of subgroups, we count fuzzy subgroups using inductive arguments. The number of such fuzzy subgroups forms a polynomial in p with pleasing combinatorial coefficients. By exploiting the order, we label the s...

Abstract. In this paper, we classify all of the finite p-groups with at most three non linear irreducible character kernels.

‎‎we investigate graham higman's paper emph{enumerating }$p$emph{-groups}‎, ‎ii‎, ‎in which he formulated his famous porc conjecture‎. ‎we are able to simplify some of the theory‎. ‎in particular‎, ‎higman's paper contains five pages of homological algebra which he uses in‎ ‎his proof that the number of solutions in a finite field to a finite set of‎ ‎emph{monomial} equations is porc‎. ‎it turn...