| Quasi-Permutation Representations of $F_{p,q}$ Houshang Behravesh
Abstract. In [1], we gave algorithms
to calculate $C(G), q(G)$ and $p(G)$ for a finite group G. Tn this paper,
we will show that $c(F_{p,q}=q(F_{p,q})=p$, where $F_{p,q}= {a,b: a^p = b^q
= 1, b^{-1}ab = a^r}, p is a prime number, q | (p-1) and q is a integer number.
|