Stack Exchange network consists of 183 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.
Is the number of a set of irreducible pojectiveprojective characters with associated factor set always strictly less than the number of the ordinary irreducible characters of a finite group G? If so, can you provide me with the relevant references.
Is the number of a set of irreducible pojective characters with associated factor set always strictly less than the number of the ordinary irreducible characters of a finite group G? If so, can you provide me with the relevant references.
Is the number of a set of irreducible projective characters with associated factor set always strictly less than the number of the ordinary irreducible characters of a finite group G? If so, can you provide me with the relevant references.
The number of irreducible projective characters with associated factor set of any finite group
Is the number of a set of irreducible pojective characters with associated factor set always strictly less than the number of the ordinary irreducible characters of a finite group G? If so, can you provide me with the relevant references.
