Answers are grounded in this paper and cite their sources.
This article computes the character covering number for PSL2, highlighting irreducible characters and their properties.
For a group G and a character χ of G, let c(χ) denote the set of all irreducible characters of G, occurring in χ. The character covering number of G is defined as the least n such that c(χⁿ)=Irr(G), for all faithful irreducible χ. In this article, we~compute the character covering number of PSL₂(q) for all q≥8.
No takes yet. Share an insight, caveat, or question.
Arvind et al. (2025) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: